Special Issue on Analysis of Boolean Functions
|
Vol 11, Article 18 (pp 445-469)
On some extensions of the FKN theorem by Jacek Jendrej, Krzysztof Oleszkiewicz, and Jakub O. Wojtaszczyk |
|
Vol 10, Article 15 (pp 389-419)
Tight Bounds for Monotone Switching Networks via Fourier Analysis by Siu Man Chan and Aaron Potechin |
|
Vol 10, Article 3 (pp 55-75)
Dimension-Free $L_2$ Maximal Inequality for Spherical Means in the Hypercube by Aram W. Harrow, Alexandra Kolla, and Leonard J. Schulman |
|
Vol 10, Article 1 (pp 1-26)
Bounding the Sensitivity of Polynomial Threshold Functions by Prahladh Harsha, Adam Klivans, and Raghu Meka |
|
Vol 9, Article 29 (pp 889-896)
[NOTE]
Hypercontractivity Via the Entropy Method by Eric Blais and Li-Yang Tan |
|
Vol 9, Article 28 (pp 863-887)
A Two-Prover One-Round Game with Strong Soundness by Subhash Khot and Muli Safra |
|
Vol 9, Article 27 (pp 845-862)
Satisfying Degree-$d$ Equations over $GF[2]^n$ by Johan Håstad |
|
Vol 9, Article 18 (pp 593-615)
Making Polynomials Robust to Noise by Alexander A. Sherstov |
|
Vol 9, Article 17 (pp 587-592)
[NOTE]
A Monotone Function Given By a Low-Depth Decision Tree That Is Not an Approximate Junta by Daniel Kane |
|
Vol 9, Article 16 (pp 579-585)
Special Issue on Analysis of Boolean Functions: Guest Editors' Foreword by Elchanan Mossel and Ryan O'Donnell |