Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates

SIAM Journal on Computing

Volumn 36, Issue 5, 2006, Pages 1387-1403

  Viola, Emanuele ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Average case hardness; Communication complexity; Constant depth circuit; Derandomization; Lower bound; Pseudorandom generator; Switching lemma; Symmetric gate

Indexed keywords

COMMUNICATION COMPLEXITY; CONSTANT-DEPTH CIRCUITS; GENERATOR STRETCHING; SYMMETRIC GATES;

COMPUTATIONAL COMPLEXITY; ELECTRIC GENERATORS; FUNCTION EVALUATION; GATES (TRANSISTOR); PROBABILITY;

POWER SUPPLY CIRCUITS;

EID: 34748857354     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050640941     Document Type: Article

References (33)

1. M. AGRAWAL, Hard sets and pseudo-random generators for constant depth circuits, in Proceedings of the 21st Annual Foundations of Software Technology and Theoretical Computer Science, Bangalore, India, Springer-Verlag, Berlin, 2001, pp. 58-69.
2. E. ALLENDER AND U. HERTRAMPF, Depth reduction for circuits of unbounded fan-in, Inform. and Comput., 112 (1994), pp. 217-238.
3. L. BABAI, L. FORTNOW, N. NISAN, AND A. WIGDERSON, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Comput. Complexity, 3 (1993), pp. 307-318.
4. L. BABAI, N. NISAN, AND M. SZEGEDY, Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs, J. Comput. System Sci., 45 (1992), pp. 204-232.
5. P. BEAME, A Switching Lemma Primer, Technical report UW-CSE-95-07-01, Department of Computer Science and Engineering, University of Washington, Seattle, WA, 1994; also available online from http://www.cs. washington.edu/homes/beame/.
6. R. BEIGEL, When do extra majority gates help? polylog(N) majority gates are equivalent to one, Comput. Complexity, 4 (1994), pp. 314-324.
7. R. BEIGEL, N. REINGOLD, AND D. A. SPIELMAN, The perceptron strikes back, in Proceedings of the Structure in Complexity Theory Conference, 1991, pp. 286-291.
8. R. BEIGEL AND J. TARUI, On ACC, Comput. Complexity, 4 (1994), pp. 350-366.
9. PH hierarchy, J. Comput. System Sci., 56 (1998), pp. 263-271.
10. A. CHATTOPADHYAY AND K. A. HANSEN, Lower bounds for circuits with few modular and symmetric gates, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), Lisboa, Portugal, Lecture Notes in Comput. Sci. 3580, L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, eds., Springer-Verlag, Berlin, 2005.
11. M. L. FURST, J. B. SAXE, AND M. SIPSER, Parity, circuits, and the polynomial-time hierarchy, Math. Systems Theory, 17 (1984), pp. 13-27.
12. A. HAJNAL, W. MAASS, P. PUDLÁK, M. SZEGEDY, AND G. TURÁN, Threshold circuits of bounded depth, J. Comput. System Sci., 46 (1993), pp. 129-154.
13. K. A. HANSEN AND P. B. MILTERSEN, Some meet-in-the-middle circuit lower bounds, in Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science 3153, Springer-Verlag, Berlin, 2004, pp. 334-345.
14. J. HÅSTAD, Computational Limitations of Small-Depth Circuits, MIT Press, Cambridge, MA, 1987.
15. J. HÅSTAD AND M. GOLDMANN, On the power of small-depth threshold circuits, Comput. Complexity, 1 (1991), pp. 113-129.
16. A. HEALY, S. P. VADHAN, AND E. VIOLA, Using nondeterminism to amplify hardness, SIAM J. Comput., 35 (2006), pp. 903-931.
17. E. KUSHILEVITZ AND N. NISAN, Communication Complexity, Cambridge University Press, Cambridge, UK, 1997.
18. N. LINIAL, Y. MANSOUR, AND N. NISAN, Constant depth circuits, Fourier transform, and learnability, J. Assoc. Comput. Mach., 40 (1993), pp. 607-620.
19. M. LUBY, B. VELICKOVIC, AND A. WIGDERSON, Deterministic approximate counting of depth-2 circuits, in Proceedings of the Second Annual Israel Symposium on Theory of Computing Systems (ISTCS), 1993, pp. 18-24.
20. N. NISAN, Pseudorandom bits for constant depth circuits, Combinatorica, 11 (1991), pp. 63-70.
21. N. NISAN AND A. WIGDERSON, Hardness versus randomness, J. Comput. System Sci., 49 (1994), pp. 149-167.
22. Ω(log n) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom, Inform. Process. Lett., 45 (1993), pp. 303-307.
23. A. A. RAZBOROV, Lower bounds on the dimension of schemes of bounded depth in a complete basis containing the logical addition function, Mat. Zametki, 41 (1987), pp. 598-607, 623.
24. A. A. RAZBOROV, Bounded arithmetic and lower bounds in Boolean complexity, in Feasible Mathematics, II, Progr. Comput. Sci. Appl. Logic 13, Birkhäuser Boston, Boston, 1995, pp. 344-386.
25. A. A. RAZBOROV AND S. RUDICH, Natural proofs, J. Comput. System Sci., 55 (1997), pp. 24-35.
26. R. SHALTIEL AND C. UMANS, Simple extractors for all min-entropies and a new pseudorandom generator, J. ACM, 52 (2005), pp. 172-216.
27. R. SMOLENSKY, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, 1987, pp. 77-82.
28. M. SUDAN, L. TREVISAN, AND S. VADHAN, Pseudorandom generators without the XOR lemma, J. Comput. System Sci., 62 (2001), pp. 236-266.
29. C. UMANS, Pseudo-random generators for all hardnesses, J. Comput. System Sci., 67 (2003), pp. 419-440.
30. E. VIOLA, The complexity of constructing pseudorandom generators from hard functions, Comput. Complexity, 13 (2004), pp. 147-188.
31. E. VIOLA, Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates, in Proceedings of the 20th Annual Conference on Computational Complexity, IEEE, 2005, pp. 198-209.
32. E. VIOLA, The Complexity of Hardness Amplification and Derandomization, Ph.D. thesis, Harvard University, Cambridge, MA, 2006.
33. A. C. YAO, On ACC and threshold circuits, in Proceedings of the 31st Annual IEEE Symposium Foundation on Computer Science, 1990, pp. 619-627.