New answers tagged combinatorics
5
votes
Concrete version of KKL Theorem
See Exercise 9.30 of Ryan O'Donnell's Analysis of Boolean Functions book [1]: for any $f\colon\{-1,1\}^n\to \{-1,1\}$,
$$
\mathbf{MaxInf}[f]\geq \frac{1}{2}\mathbf{Var}[f]\cdot \frac{\ln n}{n} (1-o(1))...
- 4,431
Top 50 recent answers are included