Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > GUY KINDLER:
All reports by Author Guy Kindler:

TR20-009 | 6th February 2020
Esty Kelman, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra

Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality

We give alternate proofs for three related results in analysis of Boolean functions, namely the KKL
Theorem, Friedgut’s Junta Theorem, and Talagrand’s strengthening of the KKL Theorem. We follow a
new approach: looking at the first Fourier level of the function after a suitable random restriction and
applying the Log-Sobolev ... more >>>




ISSN 1433-8092 | Imprint