Improved pseudorandom generators for depth 2 circuits

  • Authors:

  • Anindya De;Omid Etesami;Luca Trevisan;Madhur Tulsiani

  • Affiliations:

  • University of California at Berkeley;University of California at Berkeley;University of California at Berkeley and Stanford University;Institute for Advanced Study, Princeton

  • Venue:
  • APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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/mÕ(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.