A simple proof of Bazzi's theorem

ACM Transactions on Computation Theory

Volumn 1, Issue 1, 2009, Pages

  Razborov, Alexander ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

DNF; Pseudo random generators

Indexed keywords

DNF FORMULAS; PSEUDORANDOM GENERATORS;

THEOREM PROVING;

EID: 77749330248     PISSN: 19423454     EISSN: 19423462     Source Type: Journal    
DOI: 10.1145/1490270.1490273     Document Type: Article

References (6)

1. ASPNES, J., BEIGEL, R., FURST, M., AND RUDICH, S. 1994. The expressive power of voting polynomials. Combinatorica 14, 2, 1-14.
2. BAZZI, L. 2008. Polylogarithmic independence can fool DNF formulas. SIAM J. Comput., to appear (http://www.mit.edu/~louay/recent/kwisednf2.pdf).
3. 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.
4. LINIAL, N., MANSOUR, Y., AND NISAN, N. 1993. Constant depth circuits, Fourier transforms and learnability. J. ACM 40, 3, 607-620.
5. LINIAL, N. AND NISAN, N. 1990. Approximate inclusion-exclusion. Combinatorica 10, 4, 349-365.
6. LUBY, M. AND VELICKOVIC, B. 1996. On deterministic approximation of DNF. Algorithmica 16, 4/5, 415-433.