Improved Pseudorandom Generators for Depth 2 Circuits

We prove the existence of a poly(n,m)-time computable pseudorandom generator which "1/poly(n,m)-fools" DNFs with n variables and m terms, and has seed length O(log2nm ċ log log nm). Previously, the best pseudorandom generator for depth-2 circuits had seed length O(log3 nm), and was due to Bazzi (FOCS 2007). It follows from our proof that a 1/mO(log mn)-biased distribution 1/poly(nm)-fools DNFs with m terms and n variables. For inverse polynomial distinguishing probability this is nearly tight because we show that for every m, δ there is a 1/mΩ(log 1/δ)-biased distribution X and a DNF φ with m terms such that φ is not δ-fooled by X. For the case of read-once DNFs, we show that seed length O(log mn ċ log 1/δ) suffices, which is an improvement for large δ. It also follows from our proof that a 1/mO(log 1/δ)-biased distribution δ-fools all read-once DNF with m terms. We show that this result too is nearly tight, by constructing a 1/mΩ(log 1/δ)-biased distribution that does not δ-fool a certain m-term read-once DNF.

[1]  Noam Nisan,et al.  Approximations of general independent distributions , 1992, STOC '92.

[2]  Louis Mak.  Parallelism Always Helps , 1997, SIAM J. Comput..

[3]  Yishay Mansour,et al.  An O(nlog log n) learning algorithm for DNF under the uniform distribution , 1992, COLT '92.

[4]  Yishay Mansour,et al.  An O(n^(log log n)) Learning Algorithm for DNT under the Uniform Distribution , 1995, J. Comput. Syst. Sci..

[5]  Michael Luby,et al.  On deterministic approximation of DNF , 2005, Algorithmica.

[6]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[7]  Alexander A. Razborov.  A Simple Proof of Bazzi’s Theorem , 2009, TOCT.

[8]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[9]  Mark Braverman.  Poly-logarithmic Independence Fools AC0 Circuits , 2009, Computational Complexity Conference.

[10]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11]  Louay Bazzi,et al.  Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness , 2003 .

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

[13]  Avi Wigderson,et al.  Deterministic simulation of probabilistic constant depth circuits , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  Noga Alon,et al.  Almost k-wise independence versus k-wise independence , 2003, Information Processing Letters.

[15]  Noam Nisan,et al.  Approximate Inclusion-Exclusion , 1990, STOC '90.

[16]  Mark Braverman,et al.  Poly-logarithmic Independence Fools AC^0 Circuits , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[17]  Michael R. Capalbo,et al.  Finding Disjoint Paths in Expanders Deterministically and Online , 2007, FOCS 2007.

[18]  Louay Bazzi,et al.  Polylogarithmic Independence Can Fool DNF Formulas , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

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

[20]  Andrew Wan,et al.  Mansour's Conjecture is True for Random DNF Formulas , 2010, COLT.

[21]  Emanuele Viola,et al.  Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols , 2008, Theory Comput..

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