Poly-logarithmic independence fools AC0 circuits

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2009, Pages 3-8

  Braverman, Mark ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNF FORMULAS;

THEOREM PROVING;

COMPUTATIONAL COMPLEXITY;

EID: 70350367955     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2009.35     Document Type: Conference Paper

References (12)

1. [AGM02] N. Alon, O. Goldreich, and Y. Mansour, Almost k-wise independence versus k-wise independence, Electronic Colloquium on Computational Complexity. Report TR02-048, 2002.
2. [Baz07] L. M. J. Bazzi, Polylogarithmic independence can fool DNF formulas, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), IEEE Computer Society Washington, DC, USA, 2007, pp. 63-73.
3. [Baz09] Polylogarithmic independence can fool DNF formulas, SIAM Journal on Computing (SICOMP) (2009), to appear.
4. [Bei93] R. Beigel, The polynomial method in circuit complexity, Proceedings of the 8th IEEE Structure in Complexity Theory Conference, 1993, pp. 82-95.
5. [BRS91] R. Beigel, N. Reingold, and D. Spielman, The perceptron strikes back, Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991, pp. 286-291.
6. [LMN93] N. Linial, Y. Mansour, and N. Nisan, Constant depth circuits, Fourier transform, and learnability, Journal of the ACM (JACM) 40 (1993), no. 3, 607- 620.
7. [LN90] N. Linial and N. Nisan, Approximate inclusionexclusion, Combinatorica 10 (1990), no. 4, 349- 365.
8. [Raz87] A. A. Razborov, Lower bounds on the size of bounded-depth networks over a complete basis with logical addition, Math. Notes Acad. Sci. USSR 41 (1987), no. 4, 333-338.
9. [Raz08] A simple proof of Bazzi's theorem, Electronic Colloquium on Computational Complexity. Report TR08-081, 2008.
10. [Smo87] R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proceedings of the nineteenth annual ACM Symposium on Theory of Computing (STOC'87), ACM New York, NY, USA, 1987, pp. 77-82.
11. [Tar93] J. Tarui, Probabilistic polynomials, AC0 functions and the polynomial-time hierarchy, Theoretical computer science 113 (1993), no. 1, 167-183.
12. [VV85] L. G. Valiant and V. V. Vazirani, NP is as easy as detecting unique solutions, Proceedings of the seventeenth annual ACM Symposium on Theory of Computing (STOC'85), ACM New York, NY, USA, 1985, pp. 458-463.