Pseudorandom bits for constant depth circuits with few arbitrary symmetric gates

We exhibit an explicitly computable 'pseudorandom' generator stretching l bits into m(l) = l/sup /spl Omega/(log l)/ bits that look random to constant-depth circuits of size m(l) with log m(l) arbitrary symmetric gates (e.g. PARITY, MAJORITY). This improves on a generator by Luby, Velickovic and Wigderson (ISTCS '93) that achieves the same stretch but only fools circuits of depth 2 with one arbitrary symmetric gate at the top. Our generator fools a strictly richer class of circuits than Nisan's generator for constant depth circuits (Combinatorica '91) (but Nisan's generator has a much bigger stretch). In particular, we conclude that every function computable by uniform poly(n)-size probabilistic constant depth circuits with O(log n) arbitrary symmetric gates is in TIME (2/sup no(1)/) This seems to be the richest probabilistic circuit class known to admit a subexponential derandomization. Our generator is obtained by constructing an explicit function f : {0, 1}/sup n/ /spl rarr/ {0, 1} that is very hard on aver-age for constant-depth circuits of size n/sup /spl epsi//spl middot/log n/ with /spl epsi/log/sup 2/ n it arbitrary symmetric gates, and plugging it into the Nisan-Wigderson pseudorandom generator construction (FOCS '88). The proof of the average-case hardness of this function is a modification of arguments by Razborov and Wigderson (IPL '93), and Hansen and Miltersen (MFCS '04), and combines Hdstad's switching lemma (STOC '86) with a multiparty communication complexity lower bound by Babai, Nisan and Szegedy (STOC '89).

[1]  Emanuele Viola,et al.  The complexity of constructing pseudorandom generators from hard functions , 2005, computational complexity.

[2]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[3]  Noam Nisan,et al.  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[4]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[5]  Kristoffer Arnsfelt Hansen,et al.  Some Meet-in-the-Middle Circuit Lower Bounds , 2004, MFCS.

[6]  Christopher Umans,et al.  Simple extractors for all min-entropies and a new pseudo-random generator , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[7]  Noam Nisan,et al.  Pseudorandom bits for constant depth circuits , 1991, Comb..

[8]  S. Vadhan,et al.  The complexity of hardness amplification and derandomization , 2006 .

[9]  P. Beame.  A switching lemma primer , 1994 .

[10]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1993, JACM.

[11]  Alexander A. Razborov,et al.  n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom , 1993, Information Processing Letters.

[12]  Noam Nisan,et al.  BPP has subexponential time simulations unless EXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[13]  Christopher Umans,et al.  Pseudo-random generators for all hardnesses , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[14]  Alexander A. Razborov,et al.  Natural Proofs , 1997, J. Comput. Syst. Sci..

[15]  Daniel A. Spielman,et al.  The perceptron strikes back , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[16]  Christopher Umans,et al.  Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.

[17]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1991, computational complexity.

[18]  A. Razborov.  Bounded Arithmetic and Lower Bounds in Boolean Complexity , 1995 .

[19]  Kristoffer Arnsfelt Hansen,et al.  Lower Bounds for Circuits with Few Modular and Symmetric Gates , 2005, ICALP.

[20]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[21]  Eric Allender,et al.  Depth Reduction for Circuits of Unbounded Fan-In , 1994, Inf. Comput..

[22]  Eric Allender,et al.  A note on the power of threshold circuits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[23]  Manindra Agrawal,et al.  Hard Sets and Pseudo-random Generators for Constant Depth Circuits , 2001, FSTTCS.

[24]  Christer Berg,et al.  A Lower Bound for Perceptrons and an Oracle Separation of the PPPH Hierarchy , 1998, J. Comput. Syst. Sci..

[25]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[26]  Richard Beigel,et al.  On ACC , 1994, computational complexity.

[27]  Avi Wigderson,et al.  Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[28]  Noam Nisan,et al.  Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[29]  Andrew Chi-Chih Yao,et al.  ON ACC and threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[30]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[31]  Richard Beigel.  When do extra majority gates help? Polylog (N) majority gates are equivalent to one , 2005, computational complexity.

[32]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[33]  Emanuele Viola,et al.  Using nondeterminism to amplify hardness , 2004, STOC '04.