ConceptTheory & Algos
KKL theorem
A theorem stating that for any Boolean function, there is at least one variable whose influence is bounded below by the log of n over n times the variance.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Boolean function2Variance2Fourier analysis of Boolean functions1Hypercube analysis1Influence1Influence of variables1Total influence1
Lecturers
1Ryan O'Donnell
Connections
5The lectures that define it or assume it, and the concepts next to it.