Bounded independence fools degree-2 threshold functions

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 11-20

  Diakonikolas, Ilias ^a   Kane, Daniel M ^b   Nelson, Jelani ^c  

^a Columbia University ^*  (United States)

^b HARVARD UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Derandomization; k wise independence; Polynomial threshold functions

Indexed keywords

COMPUTERS;

BOUNDED INDEPENDENCE; DERANDOMIZATION; POLYNOMIAL THRESHOLD FUNCTIONS; PSEUDORANDOM GENERATORS; THRESHOLD FUNCTIONS;

COMPUTER SCIENCE;

EID: 78751473706     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.8     Document Type: Conference Paper

References (31)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4):567-583, 1986.
2. L. Bazzi. Polylogarithmic independence can fool DNF formulas. In FOCS, pages 63-73, 2007.
3. W. Beckner. Inequalities in Fourier analysis. Annals of Mathematics, 102(1):159-182, 1975.
4. I. Ben-Eliezer, S. Lovett, and A. Yadin. Polynomial threshold functions: Structure, approximation and pseudorandomness. CoRR, abs/0911.3473, 2009.
5. I. Benjamini, O. Gurel-Gurevich, and R. Peled. On k-wise independent distributions and boolean functions. Available at http://www.wisdom.weizmann.ac. il/~origurel/, 2007.
6. p(G). Ann. Inst. Fourier, 20:335-402, 1970.
7. 0 circuits. In CCC, pages 3-8, 2009.
8. n. Mathematical Research Letters, 8(3):233-248, 2001.
9. E. W. Cheney. Introduction to Approximation Theory. McGraw-Hill, 1966.
10. B. Chor and O. Goldreich. On the power of two-point based sampling. Journal of Complexity, 5(1):96-106, Mar. 1989.
11. I. Diakonikolas, P. Gopalan, R. Jaiswal, R. A. Servedio, and E. Viola. Bounded independence fools halfspaces. In FOCS, pages 171-180, 2009.
12. I. Diakonikolas, R. A. Servedio, L.-Y. Tan, and A. Wan. A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions. In CCC, pages 211-222, 2010.
13. K. O. Friedrichs. The identity of weak and strong extensions of differential operators. Transactions of the American Mathematical Society, 55(1):132-151, 1944.
14. M. I. Ganzburg. personal communication.
15. M. I. Ganzburg. Limit theorems of polynomial approximation with exponential weights. Memoirs of the American Mathematical Society, 2008.
16. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42:1115-1145, 1995.
17. P. Gopalan, R. O'Donnell, Y. Wu, and D. Zuckerman. Fooling functions of halfspaces under product distributions. In CCC, pages 223-234, 2010.
18. D. L. Hanson and F. T. Wright. A bound on tail probabilities for quadratic forms in independent random variables. Ann. Math. Statist., 42(3):1079-1083, 1971.
19. P. Harsha, A. Klivans, and R. Meka. An invariance principle for polytopes. In STOC, pages 543-552, 2010.
20. P. Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM, 53(3):307-323, 2006.
21. A. T. Kalai, A. R. Klivans, Y. Mansour, and R. A. Servedio. Agnostically learning halfspaces. SIAM J. Comput., 37(6):1777-1805, 2008.
22. D. M. Kane, J. Nelson, and D. P. Woodruff. On the exact space complexity of sketching and streaming small norms. In SODA, pages 1161-1178, 2010.
23. Z. Karnin, Y. Rabani, and A. Shpilka. Explicit dimension reduction and its applications. ECCC, TR09-121, 2009.
24. S. Mahajan and R. Hariharan. Derandomizing semidefinite programming based approximation algorithms. In FOCS, pages 162-169, 1995.
25. R. Meka and D. Zuckerman. Pseudorandom generators for polynomial threshold functions. In STOC (see also CoRR abs/0910.4122), pages 427-436, 2010.
26. M. A. Minsky and S. L. Papert. Perceptrons. MIT Press, Cambridge, MA, 1969 (expanded edition 1988).
27. E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. Annals of Mathematics, 171(1):295-341, 2010.
28. D. Newman and H. Shapiro. Jackson's theorem in higher dimensions. On approximation theory (Proc. Conf. Oberwolfach 1963), MR 32(310):208-219, 1964.
29. Y. Rabani and A. Shpilka. Explicit construction of a small epsilon-net for linear threshold functions. In STOC, pages 649-658, 2009.
30. A. A. Razborov. A simple proof of Bazzi's theorem. ACM Transactions on Computation Theory, 1(1), 2009.
31. D. Sivakumar. Algorithmic derandomization via complexity theory. In STOC, pages 619-626, 2002.