Sprache: Englisch
Verlag: Cambridge University Press (edition 1), 2014
ISBN 10: 1107038324 ISBN 13: 9781107038325
Anbieter: BooksRun, Philadelphia, PA, USA
Hardcover. Zustand: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
Sprache: Englisch
Verlag: Cambridge University Press (edition 1), 2014
ISBN 10: 1107038324 ISBN 13: 9781107038325
Anbieter: BooksRun, Philadelphia, PA, USA
Hardcover. Zustand: As New. 1. It's a preowned item in almost perfect condition. It has no visible cosmetic imperfections. May come without any shrink wrap; pages are clean and not marred by notes or folds of any kind.
Sprache: Englisch
Verlag: Cambridge University Press, 2014
ISBN 10: 1107038324 ISBN 13: 9781107038325
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. The field of analysis of Boolean functions seeks to understand them via their Fourier transform and other analytic methods. This text gives a thorough overview of the field, beginning with the most basic definitions and proceeding to advanced topics such as hypercontractivity and isoperimetry. Each chapter includes a 'highlight application' such as Arrow's theorem from economics, the Goldreich-Levin algorithm from cryptography/learning theory, Håstad's NP-hardness of approximation results, and 'sharp threshold' theorems for random graph properties. The book includes roughly 450 exercises and can be used as the basis of a one-semester graduate course. It should appeal to advanced undergraduates, graduate students and researchers in computer science theory and related mathematical fields.