Computer Science – Computational Complexity
Scientific paper
2010-12-07
Computer Science
Computational Complexity
Scientific paper
We show that any $O_d(\epsilon^{-4d 7^d})$-independent family of Gaussians
$\epsilon$-fools any degree-$d$ polynomial threshold function.
No associations
LandOfFree
$k$-Independent Gaussians Fool Polynomial Threshold Functions 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 $k$-Independent Gaussians Fool Polynomial Threshold Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and $k$-Independent Gaussians Fool Polynomial Threshold Functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-556121