We develop and analyze a new family of pseudorandom generators for polynomial threshold functions with respect to the Gaussian distribution. In particular, for any fixed degree we develop a generator whose seed length is subpolynomial in the error parameter, . We get particularly nice results for degree 1 and degree 2 threshold functions, in which cases our seed length is O(log(n) + log 3/2 (1/ )) and exp(O (log 2/3 (1/ ))), respectively.
For the Gaussian distribution, REF gave a PRG which achieves a seed-length of O(log n + log 3/2 (1/ε)
A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length
2014 IEEE 29th Conference on Computational Complexity (CCC)
2014 IEEE 29th Conference on Computational Complexity (CCC)
Mathematics Computer Science