Skip to content
Register Sign in Wishlist

Analysis of Boolean Functions

CAD$93.95 (P)

  • Date Published: June 2014
  • availability: Available
  • format: Hardback
  • isbn: 9781107038325

CAD$ 93.95 (P)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • 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
    Read more

    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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: June 2014
    • format: Hardback
    • isbn: 9781107038325
    • length: 444 pages
    • dimensions: 229 x 152 x 25 mm
    • weight: 0.76kg
    • contains: 13 b/w illus. 450 exercises
    • availability: 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.

  • Author

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

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.