Computer Science – Computational Complexity
Scientific paper
2011-04-06
Computer Science
Computational Complexity
Scientific paper
We develop a pseudo-random generator to fool degree-$d$ polynomial threshold
functions with respect to the Gaussian distribution. For $c>0$ any constant, we
construct a pseudo-random generator that fools such functions to within
$\epsilon$ and has seed length $\log(n) 2^{O(d)} \epsilon^{-4-c}$.
No associations
LandOfFree
A Small PRG for Polynomial Threshold Functions of Gaussians does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Small PRG for Polynomial Threshold Functions of Gaussians, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Small PRG for Polynomial Threshold Functions of Gaussians will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-717639