Sprache: Englisch
Verlag: Cambridge University Press, 2014
ISBN 10: 1107038324 ISBN 13: 9781107038325
Anbieter: Buchkanzlei, Bremen, Deutschland
Hardcover. Zustand: Sehr gut. 444 pp. very well-preserved copy 367 Sprache: Englisch Gewicht in Gramm: 754.
Sprache: Englisch
Verlag: Cambridge University Press, 2014
ISBN 10: 1107038324 ISBN 13: 9781107038325
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 97,97
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2014
ISBN 10: 1107038324 ISBN 13: 9781107038325
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 135,91
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics. Num Pages: 444 pages, 13 b/w illus. 450 exercises. BIC Classification: UMB. Category: (U) Tertiary Education (US: College). Dimension: 237 x 156 x 29. Weight in Grams: 780. . 2014. hardcover. . . . . Books ship from the US and Ireland.
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.