A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length

IEEE Conference on Computational Complexity(2014)

引用 20|浏览19
暂无评分
摘要
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, epsilon. 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/epsilon)) and exp(O~(log^{2/3}(1/epsilon))), respectively.
更多
查看译文
关键词
Gaussian distribution,computational complexity,random number generation,Gaussian distribution,degree 1 threshold functions,degree 2 threshold functions,error parameter,polynomial threshold functions,pseudorandom generator,subpolynomial seed length,Polynomial threshold function,Pseudorandom generator
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要