Completed
Analysis of Boolean Functions at CMU - Lecture 1: The Fourier expansion and basic formulas
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Analysis of Boolean Functions
Automatically move to the next video in the Classroom when playback concludes
- 1 Analysis of Boolean Functions at CMU - Lecture 1: The Fourier expansion and basic formulas
- 2 Analysis of Boolean Functions at CMU - Lecture 2: Probability densities and BLR linearity testing
- 3 Analysis of Boolean Functions at CMU - Lecture 3: Social choice and influences
- 4 Analysis of Boolean Functions at CMU - Lecture 4: Noise stability and Arrow's Theorem
- 5 Analysis of Boolean Functions at CMU - Lecture 5: Spectral concentration and learning
- 6 Analysis of Boolean Functions at CMU - Lecture 6: Restrictions and the Goldreich--Levin Theorem
- 7 Analysis of Boolean Functions at CMU - Lecture 7: DNF formulas
- 8 Analysis of Boolean Functions at CMU - Lecture 8: Linial--Mansour--Nisan Theorems
- 9 Analysis of Boolean Functions at CMU - Lecture 9: Majority, LTFs, and the CLT
- 10 Analysis of Boolean Functions at CMU - Lecture 10: LTFs and noise stability
- 11 Analysis of Boolean Functions at CMU - Lecture 11: Level-1 inequality and the 2/pi Theorem
- 12 Analysis of Boolean Functions at CMU - Lecture 12: Bonami's Lemma and the KKL Theorem
- 13 Analysis of Boolean Functions at CMU - Lecture 13: Dictator Testing and the FKN Theorem
- 14 Analysis of Boolean Functions at CMU - Lecture 14: Probabilistically checkable proofs of proximity
- 15 Analysis of Boolean Functions at CMU - Lecture 15: Constraint satisfacation problems
- 16 Analysis of Boolean Functions at CMU - Lecture 16: Håstad's hardness theorems
- 17 Analysis of Boolean Functions at CMU - Lecture 17: UG-hardness results from dictator tests
- 18 Analysis of Boolean Functions at CMU - Lecture 18: The Hypercontractivity Theorem
- 19 Analysis of Boolean Functions at CMU - Lecture 19: Invariance theorems
- 20 Analysis of Boolean Functions at CMU - Lecture 20: Majority Is Stablest Theorem
- 21 Analysis of Boolean Functions at CMU - Lecture 21: Additive combinatorics
- 22 Analysis of Boolean Functions at CMU - Lecture 22: Sanders's Theorem
- 23 Analysis of Boolean Functions at CMU - Lecture 23: Open problems
