Small sample spaces cannot fool low degree polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5171 LNCS, Issue , 2008, Pages 266-275

  Alon, Noga ^a,b   Ben Eliezer, Ido ^b   Krivelevich, Michael ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; LEARNING SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

COMBINATORIAL OP-TIMIZATION PROBLEM; LOW DEGREE; SMALL SAMPLES;

APPROXIMATION ALGORITHMS;

EID: 51849102459     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85363-3_22     Document Type: Conference Paper

References (20)

1. Alon, N.: Problems and results in extremal combinatorics, I. Discrete Math. 273, 31-53 (2003)
2. Alon, N.: Perturbed identity matrices have high rank: proof and applications. Combinatorics, Probability and Computing (to appear)
3. Alon, N., Andoni, A., Kaufman, T., Matulef, K., Rubinfeld, R., Xie, N.: Testing k-wise and almost k-wise independence. In: Proceedings of the 39th Annual ACM Symposium, STOC 2007, pp. 496-505 (2007)
4. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3, 289-304 (1992)
5. Alon, N., Roichman, Y.: Random Cayley graphs and expanders. Random Structures and Algorithms 5, 271-284 (1994)
6. Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)
7. Ben-Sasson, E., Sudan, M., Vadhan, S., Wigderson, A.: Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In: Proceedings of the 35th Annual ACM Symposium, STOC 2003, pp. 612-621 (2003)
8. Bogdanov, A.: Pseudorandom generators for low degree polynomials. In: Proceedings of the 37th Annual ACM Symposium, STOC 2005, pp. 21-30 (2005)
9. Bogdanov, A., Dvir, Z., Verbin, E., Yehudayoff, A.: Pseudorandomness for width 2 branching programs (manuscript, 2008)
10. Bogdanov, A., Viola, E.: Pseudorandom bits for polynomials. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 41-51 (2007)
11. Codenotti, B., Pudlák, P., Resta, G.: Some structural properties of low-rank matrices related to computational complexity. Theoret. Comput. Sci. 235, 89-107 (2000)
12. Dvir, Z., Shpilka, A.: Noisy interpolating sets for low degree polynomials. In: Proceedings of the 23th IEEE Conference on Computational Complexity (CCC), pp. 140-148 (2008)
13. Lovett, S.: Unconditional pseudorandom generators for low degree polynomials. In: Proceedings of the 40th Annual ACM Symposium, STOC 2008, pp. 557-562 (2008)
14. Lovett, S., Meshulam, R., Samorodnitsky, A.: Inverse conjecture for the Gowers norm is false. In: Proceedings of the 40th Annual ACM Symposium, STOC 2008, pp. 547-556 (2008)
15. Luby, M., Velickovic, B., Wigderson, A.: Deterministic approximate counting of depth-2 circuits. In: Proceedings of the 2nd ISTCS (Israeli Symposium on Theoretical Computer Science), pp. 18-24 (1993)
16. Motwani, R., Naor, J., Naor, M.: The probabilistic method yields deterministic parallel algorithms. JCSS 49(3), 478-516 (1994)
17. Naor, J., Naor, M.: Small bias probability spaces: efficient constructions and applications. In: Proceedings of the 22th Annual ACM Symposium, STOC 1990, pp. 213-223 (1990)
18. Schechtman, G., Shraibman, A.: Lower bounds for local versions of dimension reductions (manuscript, 2007)
19. Shpilka, A.: Constructions of low-degree and error-correcting ε-biased generators. In: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC), Prague, Czech Republic, pp. 33-45 (2006)
20. Viola, E.: The sum of d small-bias generators fools polynomials of degree d. In: Proceedings of the 23th IEEE Conference on Computational Complexity (CCC) , pp. 124-127 (2008)