Corpus ID: 2542968

Pseudorandomness for Read-Once, Constant-Depth Circuits

@article{Chen2015PseudorandomnessFR,
  title={Pseudorandomness for Read-Once, Constant-Depth Circuits},
  author={Sitan Chen and T. Steinke and S. Vadhan},
  journal={ArXiv},
  year={2015},
  volume={abs/1504.04675}
}
For Boolean functions computed by read-once, depth-D circuits with unbounded fan-in over the de Morgan basis, we present an explicit pseudorandom generator with seed length ~ O(log D+1 n). The previous best seed length known for this model was ~ O(log D+4 n), obtained by Trevisan and Xue (CCC ‘13 ) for all of AC 0 (not just read-once). Our work makes use of Fourier analytic techniques for pseudorandomness introduced by Reingold, Steinke, and Vadhan (RANDOM ‘13 ) to show that the generator of… Expand
7 Citations
Near-optimal pseudorandom generators for constant-depth read-once formulas
Log-seed pseudorandom generators via iterated restrictions
Fourier bounds and pseudorandom generators for product tests
  • Chin Ho Lee
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2019
Monotone Branching Programs: Pseudorandomness and Circuit Complexity
Bounded independence plus noise fools products
Bounded Independence Plus Noise

References

SHOWING 1-10 OF 36 REFERENCES
Improved Pseudorandom Generators for Depth 2 Circuits
Pseudorandomness for Regular Branching Programs via Fourier Analysis
Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs
  • T. Steinke
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2014
Pseudorandomness for Read-Once Formulas
Better Pseudorandom Generators from Milder Pseudorandom Restrictions
Deterministic simulation of probabilistic constant depth circuits
  • M. Ajtai, A. Wigderson
  • Mathematics, Computer Science
  • 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
Pseudorandom bits for constant depth circuits
  • N. Nisan
  • Mathematics, Computer Science
  • Comb.
  • 1991
Pseudorandomness for Width-2 Branching Programs
A Derandomized Switching Lemma and an Improved Derandomization of AC0
Polylogarithmic Independence Can Fool DNF Formulas
  • L. Bazzi
  • Mathematics, Computer Science
  • 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
  • 2007
...
1
2
3
4
...