Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2010
An invariance principle for polytopes
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computingPages 543–552https://doi.org/10.1145/1806689.1806764Let X be randomly chosen from {-1,1}n, and let Y be randomly chosen from the standard spherical Gaussian on Rn. For any (possibly unbounded) polytope P formed by the intersection of k halfspaces, we prove that |Pr[X ∈ P] - Pr[Y ∈ P]| ≤ log8/5k • Δ, ...
- research-articleJune 2010
Pseudorandom generators for polynomial threshold functions
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computingPages 427–436https://doi.org/10.1145/1806689.1806749We 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/εO(d) fooling degree d PTFs with error at most ε. Previously, no nontrivial ...