The sum of d small-bias generators fools polynomials of degree d

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 124-127

  Viola, Emanuele ^a  

^a Och Spine at New York Presbyterian Hospitals

Author keywords

[No Author keywords available]

Indexed keywords

BIAS GENERATORS;

COMPUTATIONAL COMPLEXITY;

EID: 51749100454     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2008.16     Document Type: Conference Paper

References (12)

1. Proceedings of the 40th Annual ACM Symposium on the Theory of Computing (STOC), Victoria, Canada, 17-20 May 2008.
2. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures & Algorithms, 3(3):289-304, 1992.
3. A. Bogdanov. Pseudorandom generators for low degree polynomials. In STOC'05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 21-30, New York, 2005. ACM.
4. A. Bogdanov and E. Viola. Pseudorandom bits for polynomials. In 48th Annual Symposium on Foundations of Computer Science. IEEE, Oct. 2007.
5. 3 norm, 2005. arXiv.org:math/0503014.
6. B. Green and T. Tao. The distribution of polynomials over finite fields, with applications to the gowers norms, 2007. arXiv:0711.3191v1.
7. S. Lovett. Pseudorandom generators for low degree polynomials. In ACM [1].
8. S. Lovett, R. Meshulam, and A. Samorodnitsky. Inverse conjecture for the gowers norm is false. In ACM [1].
9. M. Luby, B. Velickovic, and A. Wigderson. Deterministic approximate counting of depth-2 circuits. In Proceedings of the 2nd Israeli Symposium on Theoretical Computer Science (ISTCS), pages 18-24, 1993.
10. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. In Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, pages 213-223, 1990.
11. A. Samorodnitsky. Low-degree tests at large distances. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, CA USA, 2007.
12. E. Viola and A. Wigderson. Norms, xor lemmas, and lower bounds for GF(2) polynomials and multiparty protocols. In Proceedings of the 22nd Annual Conference on Computational Complexity. IEEE, June 13-16 2007.