Abstract
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.
- Aspnes, J., Beigel, R., Furst, M., and Rudich, S. 1994. The expressive power of voting polynomials. Combinatorica 14, 2, 1--14.Google Scholar
Cross Ref
- Bazzi, L. 2008. Polylogarithmic independence can fool DNF formulas. SIAM J. Comput., to appear (http://www.mit.edu/~louay/recent/kwisednf2.pdf). Google Scholar
Digital Library
- Beigel, R., Reingold, N., and Spielman, D. 1991. The perceptron strikes back. In Proceedings of the 6th IEEE Conference on Structure in Complexity Theory, IEEE Computer Society Press, Los Alamitos, CA, 286--291.Google Scholar
- Linial, N., Mansour, Y., and Nisan, N. 1993. Constant depth circuits, Fourier transforms and learnability. J. ACM 40, 3, 607--620. Google Scholar
Digital Library
- Linial, N. and Nisan, N. 1990. Approximate inclusion-exclusion. Combinatorica 10, 4, 349--365.Google Scholar
Cross Ref
- Luby, M. and Velickovic, B. 1996. On deterministic approximation of DNF. Algorithmica 16, 4/5, 415--433.Google Scholar
Index Terms
A Simple Proof of Bazzi’s Theorem
Recommendations
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider two standard variants of this problem. The first one is two-level logic ...
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 techniquesWe prove the existence of a poly(n,m)-time computable pseudorandom generator which "1/poly(n,m)-fools" DNFs with n variables and m terms, and has seed length O(log2nm ċ log log nm). Previously, the best pseudorandom generator for depth-2 circuits had ...
An algebraic proof of the real number PCP theorem
The PCP theorem has recently been shown to hold as well in the real number model of Blum, Shub, and Smale (Baartse and Meer, 2015). The proof given there structurally closely follows the proof of the original PCP theorem by Dinur (2007). In this paper ...






Comments