Improved pseudorandom generators for depth 2 circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6302 LNCS, Issue , 2010, Pages 504-517

  De, Anindya ^a   Etesami, Omid ^a   Trevisan, Luca ^a,b   Tulsiani, Madhur ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b STANFORD UNIVERSITY   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

DNF; pseudorandom generators; small bias spaces

Indexed keywords

EID: 78149304713     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_38     Document Type: Conference Paper

References (21)

1. Ajtai, M., Wigderson, A.: Deterministic simulation of probabilistic constand-depth circuits. Advances in Computing Research - Randomness and Computation 5, 199-223 (1989);
2. Preliminary version in Proc. of FOCS 1985
3. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3(3), 289-304 (1992)
4. Alon, N., Goldreich, O., Mansour, Y.: Almost k-wise independence versus k-wise independence. Information Processing Letters 88(3), 107-110 (2003)
5. Bazzi, L.: Minimum Distance of Error Correcting Codes versus Encoding Complexity, Symmetry, and Pseudorandomness. PhD thesis, MIT (2003)
6. Bazzi, L.: Polylogarithmic independence can fool DNF formulas. In: Proceedings of the 48th IEEE Symposium on Foundations of Computer Science, pp. 63-73 (2007)
7. 0 circuits. In: Proceedings of the 24th IEEE Conference on Computational Complexity, pp. 3-8 (2009)
8. Even, G., Goldreich, O., Luby, M., Nisan, N., Velickovic, B.: Approximations of general independent distributions. In: Proceedings of the 24th ACM Symposium on Theory of Computing, pp. 10-16 (1992)
9. Håstad, J.: Almost optimal lower bounds for small depth circuits. In: Proceedings of the 18th ACM Symposium on Theory of Computing, pp. 6-20 (1986)
10. Klivans, A., Lee, H.,Wan, A.: Mansour's conjecture is true for random DNF formulas. Technical Report TR10-023, Electronic Colloquium on Computational Complexity (2010)
11. Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, fourier transform and learnability. Journal of the ACM 40(3), 607-620 (1993) (Pubitemid 23707885)
12. Linial, N., Nisan, N.: Approximate inclusion-exclusion. Combinatorica 10(4), 349-365 (1990)
13. Luby, M., Velickovic, B.: On deterministic approximation of DNF. Algorithmica 16(4/5), 415-433 (1996)
14. Luby, M., Velickovic, B., Wigderson, A.: Deterministic approximate counting of depth-2 circuits. In: Proceedings of the 2nd ISTCS, pp. 18-24 (1993)
15. Mak, L.: Parallelism always helps. Manuscript (1993)
16. log log n) learning algorithm for DNF under the uniform distribution. Journal of Computer and System Sciences 50(3), 543-550 (1995)
17. Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. SIAM Journal on Computing 22(4), 838-856 (1993) (Pubitemid 23677151)
18. Nisan, N.: Pseudorandom bits for constant depth circuits. Combinatorica 12(4), 63-70 (1991)
19. O'Donnell, R.: Lecture notes for analysis of boolean functions (2007), http://www.cs.cmu.edu/~odonnell/boolean-analysis
20. Razborov, A.: A Simple Proof of Bazzi's Theorem. ACM Trans. Comput. Theory 1(1), 1-5 (2009)
21. Viola, E., Wigderson, A.: Norms, XOR lemmas, and lower bounds for polynomials and protocols. Theory of Computing 4(1), 137-168 (2008)