Analysis of Boolean Functions

by Ryan O'Donnell

Fall 2012 course at Carnegie Mellon

Posts Facebook Twitter

About/Contact
Notation
Bibliography
How to help
Heroes
Acknowledgments

Contents

Book (65)
- All chapter sections (40)
- Chapter 1: Boolean functions and the Fourier expansion (8)
- Chapter 2: Basic concepts and social choice (9)
- Chapter 3: Spectral structure and learning (8)
- Chapter 4: DNF formulas and small-depth circuits (8)
- Chapter 5: Majority and threshold functions (9)
- Chapter 6: Pseudorandomness and ${\mathbb F}_2$-polynomials (8)
- Chapter 7: Property testing, PCPPs, and CSPs (7)
- Chapter 8: Generalized domains (6)
- Chapter notes (7)
- Chapter overview (8)
- Deleted scenes (1)
- Exercises (9)
CMU Online Course (23)
Simons Symposium (9)
Uncategorized (5)

Chapter 6 exercises

[...]

October 14th, 2012 | Tags: Dickson's Theorem, Gowers norm, granularity, junta learning, random function | Category: Chapter 6: Pseudorandomness and ${\mathbb F}_2$-polynomials, Exercises | Leave a comment

Other Courses

Dinur & Friedgut @ Hebrew U
Hatami @ McGill
Kindler @ Weizmann
Mossel @ Berkeley
O'Donnell @ CMU
Regev @ ENS
Sanders @ Cambridge
van Melkebeek @ Wisconsin

Recent comments

Deepak: Cool! That all makes sense.
Ryan O'Donnell: Thanks on both!
Ryan O'Donnell: 1. Fixed, thanks 2. Fixed, thanks 3. For the first two occ...
Avishay Tal: Two small comments regarding the proof of theorem 16. - In ...
Deepak: A couple of small things: Ex. 42, under equation (2), \pi...
Ryan O'Donnell: Correct, thanks!
Tim Black: I think your $j$ should be an $i$ (or vice-versa) in the sen...

Copyright © 2013 Ryan O'Donnell -- All Rights Reserved
"Grey cube" painting by Amanda Williams
Powered by WordPress & Atahualpa