## Find a copy online

### Links to this item

## Find a copy in the library

Finding libraries that hold this item...

## Details

Genre/Form: | Electronic books |
---|---|

Additional Physical Format: | Print version: O'Donnell, Ryan, 1979- Analysis of boolean functions. (DLC) 2013050033 |

Material Type: | Document, Internet resource |

Document Type: | Internet Resource, Computer File |

All Authors / Contributors: |
Ryan O'Donnell; Cambridge University Press. |

ISBN: | 1139814788 9781139814782 |

OCLC Number: | 892573922 |

Description: | 1 online resource. |

Contents: | Boolean functions and the Fourier expansion -- Basic concepts and social choice -- Spectral structure and learning -- DNF formulas and small-depth circuits -- Majority and threshold functions -- Pseudorandomness and F₂-polynomials -- Property testing, PCPPs, and CSPs -- Generalized domains -- Basics of hypercontractivity -- Advanced hypercontractivity -- Gaussian space and invariance principles. |

Responsibility: | Ryan O'Donnell, Carnegie Mellon University, Pittsburgh, Pennsylvania. |

### Abstract:

## Reviews

*Editorial reviews*

Publisher Synopsis

'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 Read more...

*User-contributed reviews*