Better Pseudorandom Generators from Milder Pseudorandom Restrictions

@article{Gopalan2012BetterPG,
  title={Better Pseudorandom Generators from Milder Pseudorandom Restrictions},
  author={P. Gopalan and Raghu Meka and O. Reingold and L. Trevisan and S. Vadhan},
  journal={2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
  year={2012},
  pages={120-129}
}
  • P. Gopalan, Raghu Meka, +2 authors S. Vadhan
  • Published 2012
  • Mathematics, Computer Science
  • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
We present an iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and read-once CNFs and a hitting set generator for width-3 branching programs, all of which achieve near-optimal seed-length even in the low-error regime: We get seed-length Õ(log (n/ε)) for error ε. Previously, only constructions with seed-length O(log3/2 n) or O… Expand
66 Citations
Log-seed pseudorandom generators via iterated restrictions
  • 2
  • PDF
Pseudorandomness for concentration bounds and signed majorities
  • 5
  • PDF
Pseudorandomness via the Discrete Fourier Transform
  • 33
  • PDF
Pseudodistributions That Beat All Pseudorandom Generators
  • PDF
Pseudorandom generators for width-3 branching programs
  • 12
  • PDF
Space Pseudorandom Generators by Communication Complexity Lower Bounds
  • A. Ganor, R. Raz
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2013
  • 5
  • PDF
Pseudorandomness for Regular Branching Programs via Fourier Analysis
  • 42
  • PDF
Hitting sets with near-optimal error for read-once branching programs
  • 10
Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs
  • T. Steinke
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2014
  • 19
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 75 REFERENCES
Pseudorandom generators for group products: extended abstract
  • 36
  • PDF
Improved Pseudorandom Generators for Depth 2 Circuits
  • 57
  • PDF
Unconditional pseudorandom generators for low degree polynomials
  • Shachar Lovett
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2007
  • 57
  • PDF
Pseudorandom generators for space-bounded computation
  • N. Nisan
  • Mathematics, Computer Science
  • Comb.
  • 1992
  • 459
  • Highly Influential
Pseudorandom Bits for Polynomials
  • Andrej Bogdanov, E. Viola
  • Mathematics, Computer Science
  • 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
  • 2007
  • 113
  • PDF
Derandomized Constructions of k-Wise (Almost) Independent Permutations
  • 81
  • PDF
Pseudorandomness for Permutation and Regular Branching Programs
  • A. De
  • Mathematics, Computer Science
  • 2011 IEEE 26th Annual Conference on Computational Complexity
  • 2011
  • 42
  • Highly Influential
  • PDF
Pseudorandomness for Width-2 Branching Programs
  • 30
  • PDF
Improved Pseudorandom Generators for Combinatorial Rectangles
  • C. Lu
  • Mathematics, Computer Science
  • ICALP
  • 1998
  • 36
  • Highly Influential
Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs
  • 17
  • Highly Influential
  • PDF
...
1
2
3
4
5
...