Analysis of Boolean Functions
Analysis of Boolean Functions
$89.99
USDBoolean 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.
- The first textbook on the field of analysis of Boolean functions
- Appeals not just to researchers in theoretical computer science but also to mathematicians working on combinatorics, random graph theory, social choice and other areas
- Accompanied by a blog/website with book content, 23 80-minute lecture videos, additional news content, comments and interaction
- Includes roughly 500 exercises and can be used as the basis of a one-semester graduate course
Reviews & endorsements
'The applications of the ideas in this book are plentiful and diverse, and O’Donnell does an excellent job of leading the reader from one viewpoint to the next. I found it especially enjoyable to see theorems that I’m personally familiar with as a cryptographer, such as the Goldreich–Levin theorem, placed alongside other things I didn’t know as well, like Arrow’s theorem from social choice - with everything woven into a single, consistent story. I suspect other ‘fresh readers’ will similarly find parts of this book that they recognize, and others they don’t. The relationships exposed between these ideas should be of interest to everyone. Altogether, I highly recommend that you take a glance at Analysis of Boolean Functions.' Daniel Apon, SIGACT News
'This 423-page book is a rich source of material presented in an attractive form. Each chapter highlights one main result which provides a focus and incentive for the reader to go to the end of the chapter.' Martin C. Cooper, MathSciNet
Product details
June 2014Hardback
9781107038325
444 pages
229 × 152 × 25 mm
0.76kg
13 b/w illus. 450 exercises
Available
Table of Contents
- 1. Boolean functions and the Fourier expansion
- 2. Basic concepts and social choice
- 3. Spectral structure and learning
- 4. DNF formulas and small-depth circuits
- 5. Majority and threshold functions
- 6. Pseudorandomness and F2-polynomials
- 7. Property testing, PCPPs, and CSPs
- 8. Generalized domains
- 9. Basics of hypercontractivity
- 10. Advanced hypercontractivity
- 11. Gaussian space and invariance principles.
