Pseudorandom generators for polynomial threshold functions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 427-436

  Meka, Raghu ^a   Zuckerman, David ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

branching programs; halfspaces; invariance principles; polynomials; pseudorandom generators; threshold functions

Indexed keywords

BRANCHING PROGRAMS; HALF SPACES; INVARIANCE PRINCIPLE; INVARIANCE PRINCIPLES; PSEUDORANDOM GENERATORS; THRESHOLD FUNCTIONS;

COMPUTATION THEORY; POLYNOMIALS; SPHERES;

SEED;

EID: 77954724419     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806749     Document Type: Conference Paper

References (24)

1. J. ASPNES, R. BEIGEL, M. L. FURST, and S. RUDICH. The expressive power of voting polynomials. Combinatorica, 14(2):135-148, 1994. (Preliminary version in 23rd STOC, 1991).
2. N. AILON and B. CHAZELLE. Approximate nearest neighbors and the fast johnson-lindenstrauss transform. In STOC, pages 557-563. ACM, New York, NY, USA, 2006.
3. ROBERT BEALS, HARRY BUHRMAN, RICHARD CLEVE, MICHELE MOSCA, and RONALD DE WOLF. Quantum lower bounds by polynomials. Journal of the ACM, 48(4):778-797, 2001. (Preliminary version in 39th FOCS, 1998). arXiv:quant-ph/9802049.
4. RICHARD BEIGEL. The polynomial method in circuit complexity. In Proc. of 8th Annual Structure in Complexity Theory Conference, pages 82-95. 1993.
5. n. Mathematical Research Letters, 8(3):233-248, 2001.
6. ILIAS DIAKONIKOLAS, PARIKSHIT GOPALAN, RAGESH JAISWAL, ROCCO A. SERVEDIO, and EMANUELE VIOLA. Bounded independence fools halfspaces. In FOCS. 2009.
7. ILIAS DIAKONIKOLAS, ROCCO A. SERVEDIO, LI-YANG TAN, and ANDREW WAN. A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions. In CCC, to appear. 2010.
8. PARIKSHIT GOPALAN, RYAN O'DONNELL, YI WU, and DAVID ZUCKERMAN. Fooling functions of halfspaces under product distributions. In CCC, to appear. 2010.
9. PARIKSHIT GOPALAN and JAIKUMAR RADHAKRISHNAN. Finding duplicates in a data stream. In SODA, pages 402-411. 2009.
10. JOHAN HASTAD. On the size of weights for threshold gates. SIAM J. Discret. Math., 7(3):484-492, 1994.
11. PRAHLADH HARSHA, ADAM KLIVANS, and RAGHU MEKA. Bounding the sensitivity of polynomial threshold functions, 2009. arXiv:0909.5175.
12. PRAHLADH HARSHA, ADAM KLIVANS, and RAGHU MEKA. . An invariance principle for polytopes. In STOC, to appear. 2010.
13. RUSSELL IMPAGLIAZZO, NOAM NISAN, and AVI WIGDERSON. Pseudorandomness for network algorithms. In STOC, pages 356-364. 1994.
14. ZOHAR SHAY KARNIN, YUVAL RABANI, and AMIR SHPILKA. Explicit dimension reduction and its applications. ECCC, 16(121), 2009.
15. O(n1/3). Journal of Computer and System Sciences, 68(2):303-318, 2004. (Preliminary version in 33rd STOC, 2001).
16. ELCHANAN MOSSEL, RYAN O'DONNELL, and KRZYSZTOF OLESZKIEWICZ. Noise stability of functions with low influences: invariance and optimality. In FOCS, pages 21-30. 2005.
17. WOLFGANG MAASS and GYÖRGY TURÁN. How fast can a threshold gate learn? In Proceedings of a workshop on Computational learning theory and natural learning systems (vol. 1) : constraints and prospects, pages 381-414. MIT Press, Cambridge, MA, USA, 1994.
18. NOAM NISAN. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
19. JOSEPH NAOR and MONI NAOR. Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4):838-856, 1993.
20. NOAM NISAN and DAVID ZUCKERMAN. Randomness is linear in space. J. Comput. Syst. Sci., 52(1):43-52, 1996.
21. RYAN O'DONNELL. Some topics in analysis of boolean functions. In STOC, pages 569-578. ACM, New York, NY, USA, 2008.
22. YUVAL RABANI and AMIR SHPILKA. Explicit construction of a small epsilon-net for linear threshold functions. In STOC, pages 649-658. 2009.
23. ROCCO A. SERVEDIO. Every linear threshold function has a low-weight approximator. In CCC, pages 18-32. 2006.
24. D. SIVAKUMAR. Algorithmic derandomization via complexity theory. In STOC, pages 619-626. ACM, New York, NY, USA, 2002.