Polylogarithmic independence fools AC0 circuits

Journal of the ACM

Volumn 57, Issue 5, 2010, Pages

  Braverman, Mark ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Circuit complexity; Lower bounds; Polynomial approximations; Pseudorandomness

Indexed keywords

CIRCUIT COMPLEXITY; DNF FORMULAS; LOWER BOUNDS; POLYLOGARITHMIC; PSEUDORANDOMNESS;

THEOREM PROVING;

POLYNOMIAL APPROXIMATION;

EID: 77954011327     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1754399.1754401     Document Type: Article

References (13)

1. ALON, N., GOLDREICH, O., AND MANSOUR, Y. 2002. Almost k-wise independence versus k-wise independence. In Electronic Colloquium on Computational Complexity. Report TR02-048.
2. BAZZI, L. M. J. 2007. Polylogarithmic independence can fool DNF formulas. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE Computer Society Press, Los Alamitos, CA, 63-73.
3. BAZZI, L. M. J. 2009. Polylogarithmic independence can fool DNF formulas. SIAM J. Computing (SICOMP) 38, 6, 2220-2272.
4. BEIGEL, R. 1993. The polynomialmethod in circuit complexity. In Proceedings of the 8th IEEE Structure in Complexity Theory Conference. IEEE Computer Society Press, Los Alamitos, CA, 82-95.
5. BEIGEL, R., REINGOLD, N., AND SPIELMAN, D. 1991. The perceptron strikes back. In Proceedings of the 6th Annual Structure in Complexity Theory Conference. IEEE Computer Society Press, Los Alamitos, CA, 286-291.
6. HåSTAD, J. 2001. A slight sharpening of LMN. J. Comput. Syst. Sci. 63, 3, 498-508.
7. LINIAL, N., MANSOUR, Y., AND NISAN, N. 1993. Constant depth circuits, Fourier transform, and learnability. J. ACM 40, 3, 607-620.
8. LINIAL, N., AND NISAN, N. 1990. Approximate inclusion-exclusion. Combinatorica 10, 4, 349-365.
9. RAZBOROV, A. A. 1987. Lower bounds on the size of bounded-depth networks over a complete basis with logical addition. Math. Notes Acad. Sci. USSR 41, 4, 333-338.
10. RAZBOROV, A. A. 2008. A simple proof of Bazzi's theorem. In Electronic Colloquium on Computational Complexity. Report TR08-081.
11. SMOLENSKY, R. 1987. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC'87). ACM New York, 77-82.
12. TARUI, J. 1993. Probabilistic polynomials, AC0 functions and the polynomial-time hierarchy. Theoret. Comput. Sci. 113, 1, 167-183.
13. VALIANT, L. G., AND VAZIRANI, V. V. 1985. NP is as easy as detecting unique solutions. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC'85). ACM New York, 458-463.