Analysis of Boolean Functions (Hardcover)

Ryan O'Donnell

ISBN 10: 1107038324 / ISBN 13: 9781107038325

Edité par Cambridge University Press, Cambridge, 2014

A propos de cet article

Hardcover. 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 GoldreichLevin algorithm from cryptography/learning theory, Hastad'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. This graduate-level 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, the GoldreichLevin algorithm, hardness of approximation, and 'sharp threshold' theorems for random graphs. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

N° de réf. du vendeur 9781107038325

Détails bibliographiques

• Titre: Analysis of Boolean Functions (Hardcover)
• Éditeur: Cambridge University Press, Cambridge
• Date de parution: 2014
• Langue: anglais
• ISBN à 10 chiffres: 1107038324
• ISBN à 13 chiffres: 9781107038325
• Reliure: Hardcover
• État de l'article: new

A propos de ce titre

Synopsis

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.

À propos de l?auteur

Ryan O'Donnell is an Associate Professor in the Computer Science Department at Carnegie Mellon University.