Computer Science – Computational Complexity
Scientific paper
2009-10-21
Computer Science
Computational Complexity
Revision 5: Updated to the journal version to appear in SICOMP. Revision 4: Improves seed-length for halfspaces to O(log n + l
Scientific paper
We study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed-length log n/eps^{O(d)} fooling degree d PTFs with error at most eps. Previously, no nontrivial constructions were known even for quadratic threshold functions and constant error eps. For the class of degree 1 threshold functions or halfspaces, we construct PRGs with much better dependence on the error parameter eps and obtain a PRG with seed-length O(log n + log^2(1/eps)). Previously, only PRGs with seed length O(log n log^2(1/eps)/eps^2) were known for halfspaces. We also obtain PRGs with similar seed lengths for fooling halfspaces over the n-dimensional unit sphere. The main theme of our constructions and analysis is the use of invariance principles to construct pseudorandom generators. We also introduce the notion of monotone read-once branching programs, which is key to improving the dependence on the error rate eps for halfspaces. These techniques may be of independent interest.
Meka Raghu
Zuckerman David
No associations
LandOfFree
Pseudorandom Generators for 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 Pseudorandom Generators for Polynomial Threshold Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudorandom Generators for Polynomial Threshold Functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-144510