Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Polylogarithmic Independence Can Fool DNF Formulas
SIAM Journal on Computing
BQP and the polynomial hierarchy
Proceedings of the forty-second ACM symposium on Theory of computing
Improved pseudorandom generators for depth 2 circuits
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Bounded Independence Fools Halfspaces
SIAM Journal on Computing
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |
Linial and Nisan [1990] asked if any polylog-wise independent distribution fools any function in AC0. In a recent remarkable development, Bazzi solved this problem for the case of DNF formulas. The aim of this note is to present a simplified version of his proof.