
Analysis of Boolean Functions at CMU
Dormant Last read · last published · next check
Read 1 day ago and current, but nothing has been published for 9 years.
Latest videos
Saves to your Watch queue, to pick up on another day or another device.


Analysis of Boolean Functions at CMU - Lecture 14: Probabilistically checkable proofs of proximity

Analysis of Boolean Functions at CMU - Lecture 13: Dictator Testing and the FKN Theorem

Analysis of Boolean Functions at CMU - Lecture 12: Bonami's Lemma and the KKL Theorem

Analysis of Boolean Functions at CMU - Lecture 11: Level-1 inequality and the 2/pi Theorem

Analysis of Boolean Functions at CMU - Lecture 10: LTFs and noise stability

Analysis of Boolean Functions at CMU - Lecture 9: Majority, LTFs, and the CLT

Analysis of Boolean Functions at CMU - Lecture 8: Linial--Mansour--Nisan Theorems

Analysis of Boolean Functions at CMU - Lecture 7: DNF formulas

