Corpus ID: 2542968

Pseudorandomness for Read-Once, Constant-Depth Circuits

@article{Chen2015PseudorandomnessFR,
  title={Pseudorandomness for Read-Once, Constant-Depth Circuits},
  author={Sitan Chen and Thomas Steinke and Salil P. 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
8 Citations
Near-optimal pseudorandom generators for constant-depth read-once formulas
TLDR
The crux of this work is showing that after poly(log log n) independent applications of the pseudorandom restriction, the formula simplifies in the sense that every gate other than the output has only polylog n remaining children. Expand
Pseudorandom Generators for Read-Once Monotone Branching Programs
Motivated by the derandomization of space-bounded computation, there has been a long line of work on constructing pseudorandom generators (PRGs) against various forms of read-once branching programsExpand
Log-seed pseudorandom generators via iterated restrictions
TLDR
The iterated restrictions approach is used to construct an explicit PRG for read-once depth-2 AC0[⊕] formulas with optimal seed length O(log n) with near-optimal error, and a tail bound for subset-wise symmetric polynomials is extended. Expand
Fourier bounds and pseudorandom generators for product tests
  • Chin Ho Lee
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2019
TLDR
Pseudorandom generators are constructed for Fourier spectrum functions with seed length Õ(m + log(k/ε), which is optimal up to polynomial factors in log m, log log k and log log(1/ε). Expand
Monotone Branching Programs: Pseudorandomness and Circuit Complexity
TLDR
It is proved that constant-width monotone branching programs of polynomial size are equivalent in power to AC circuits, and an explicit pseudorandom generator that ε-fools length n programs with seed length Õ(log(n/ε)). Expand
Tight Space Complexity of the Coin Problem
In the coin problem we are asked to distinguish, with probability at least 2/3, between n i.i.d. coins which are heads with probability 1 2 + β from ones which are heads with probability 1 2 − β. WeExpand
Bounded independence plus noise fools products
TLDR
Communication lower bounds for decoding noisy codewords of length $m$ split among $k$ parties are proved and two applications are developed. Expand
Bounded Independence Plus Noise
Bounded Independence Plus Noise

References

SHOWING 1-10 OF 36 REFERENCES
Improved Pseudorandom Generators for Depth 2 Circuits
TLDR
It is shown that seed length O(log mn ċ log 1/δ) suffices, which is an improvement for large δ, and it follows from the existence of a poly(n,m)-time computable pseudorandom generator that a 1/mO( log mn)-biased distribution 1/poly(nm)-fools DNFs with m terms and n variables are proved. Expand
Pseudorandomness for Regular Branching Programs via Fourier Analysis
We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is O(log2 n),Expand
Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs
  • T. Steinke
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2014
TLDR
An explicit pseudorandom generator for oblivious, read-once, width-3 branching programs, which can read their input bits in any order, and has seed length O~( log^3 n ). Expand
Pseudorandomness for Read-Once Formulas
TLDR
An explicit construction of a pseudorandom generator for read-once formulas whose inputs can be read in arbitrary order is given and it is shown that such branching programs are more powerful distinguishers than those that read their inputs in sequential order. Expand
Better Pseudorandom Generators from Milder Pseudorandom Restrictions
TLDR
This template is used 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. Expand
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
TLDR
The number of satisfying assignments to a (CNF or DNF) formula, if not too small, can be arbitrarily approximated in DSPACE(nε) and DTIME(2nε), for any ε ≫ 0. Expand
Pseudorandom bits for constant depth circuits
  • N. Nisan
  • Mathematics, Computer Science
  • Comb.
  • 1991
TLDR
This work constructs a family of functions that convert a polylogarithmic number of truly random bits ton bits that appear random to any family of circuits of polynomial size and depthd, and shows that the complexity class AM is equal to the class of languages recognizable in NP with a random oracle. Expand
Pseudorandomness for Width-2 Branching Programs
TLDR
It is shown that pseudorandom generators that fool degree k polynomials over F2 for an arbitrary constant k can also be used to fool branching programs of width 2 and polynomial length that read k bits of inputs at a time. Expand
A Derandomized Switching Lemma and an Improved Derandomization of AC0
TLDR
A new pseudorandom generator for AC0 is described, based on a "pseudorandom restriction'' generator which outputs restrictions that satisfy the conclusions of the Hastad Switching Lemma and that uses a seed of polylogarithmic length. Expand
Polylogarithmic Independence Can Fool DNF Formulas
  • L. Bazzi
  • Mathematics, Computer Science
  • 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
  • 2007
TLDR
It is shown that any k-wise independent probability measure on {0, 1}n can O(m2ldr 2ldr2-radick/10)-fool any boolean function computable by an rn-clauses DNF (or CNF) formula on n variables, and this resolves, asymptotically and up to a logm factor, the depth-2 circuits case of a conjecture due to Linial and Nisan (1990). Expand
...
1
2
3
4
...