• Corpus ID: 46797432

Nisan-Wigderson Pseudorandom Generators for Circuits with Polynomial Threshold Gates

  title={Nisan-Wigderson Pseudorandom Generators for Circuits with Polynomial Threshold Gates},
  author={Valentine Kabanets and Zhenjian Lu},
  journal={Electron. Colloquium Comput. Complex.},
We show how the classical Nisan-Wigderson (NW) generator [NW94] yields a nontrivial pseudorandom generator (PRG) for circuits with sublinearly many polynomial threshold function (PTF) gates. For the special case of a single PTF of degree d on n inputs, our PRG for error has the seed size exp ( O (√ d · log n · log log(n/ ) )) ; this can give a super-polynomial stretch even for a sub-exponentially small error parameter = exp(−n), for any γ = o(1). In contrast, the best known PRGs for PTFs of… 
1 Citations
A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in and Logarithmic in n
This work constructs and analyzes a pseudorandom generator for degree 2 boolean polynomial threshold functions and gives an explicit construction that uses a seed length of O(logn+( 1 ) o(1).


Pseudorandom generators without the XOR Lemma
Two different approaches are presented to proving the main result of Impagliazzo and Wigderson that if there exists a decision problem solvable in time 2/sup O(n)/ and having circuit complexity 2/Sup /spl Omega/(n)/ then P=BPP.
Pseudorandomness from Shrinkage
This work shows that when such lower bounds are proved using random restrictions, it can construct PRGs which are essentially best possible without in turn improving the lower bounds.
Near-optimal conversion of hardness into pseudo-randomness
These results are based on the NW (Nisan & Wigderson, 1997) generator and are able to obtain derandomization in almost optimal time using any lower bound functions s(n).
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
A pseudo-random generator which produces n instances of a problem for which the analog of the XOR lemma holds is given, and it is shown that if any problem in E = DTIAl E(2°t”j) has circuit complexity 2Q(”), then P = BPP.
Hardness vs Randomness
Pseudorandom bits for constant depth circuits
  • N. Nisan
  • Computer Science, Mathematics
  • 1991
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.
Correlation bounds for poly-size AC 0 circuits with n 1-o(1) symmetric gates
Average-case circuit lower bounds are one of the hardest problems tackled by computational complexity, and are essentially only known for bounded-depth circits with AND,OR,NOT gates (i.e. AC0). Faced
Deterministic approximate counting of depth-2 circuits
The authors give an algorithm which for a given GF(2) multivariate polynomial p and given in >0 approximates the number of zeros of p within a multiplicative factor 1+ in .
Unconditional pseudorandom generators for low degree polynomials
We give an explicit construction of pseudorandom generators against low degree polynomials over finite fields. We show that the sum of 2d small-biased generators with error ε2O(d) is a pseudorandom