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

Computational Complexity

Volumn 18, Issue 2, 2009, Pages 209-217

  Viola, Emanuele ^a  

^a Northeastern University   (United States)

Author keywords

Degree; Polynomial; Pseudorandom generator; Small bias

Indexed keywords

EID: 68149150037     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-009-0273-5     Document Type: Conference Paper

References (12)

1. N. ALON, O. GOLDREICH, J. HÅSTAD & RENÉ PERALTA (1992). Simple constructions of almost fe-wise independent random variables. Random Structures & Algorithms 3(3), 289-304. ISSN 1042-9832.
2. A. BOGDANOV (2005). Pseudorandom generators for low degree polynomials. In 37th Annual Symposium on Theory of Computing (STOC), 21-30. ACM.
3. A. BOGDANOV & E. VIOLA (2007). Pseudorandom bits for polynomials. In 48th Annual Symposium on Foundations of Computer Science (FOCS), 41-51. IEEE.
4. B. GREEN & T. TAO (2007). The distribution of polynomials over finite fields, with applications to the Gowers norms. ArXiv:0711.3191v1.
5. 3(G) norm. Proceedings of the Edinburgh Mathematical Society (Series 2) 51(01), 73-153.
6. S. LOVETT (2008). Unconditional pseudorandom generators for low degree polynomials. In 40th Annual Symposium on the Theory of Computing (STOC), 557-562. ACM.
7. S. LOVETT, R. MESHULAM & A. SAMORODNITSKY (2008). Inverse Conjecture for the Gowers norm is false. In 40th Annual Symposium on the Theory of Computing (STOC), 547-556. ACM.
8. LUBY, B. VELIČKOVIĆ & A. WIGDERSON (1993). Deterministic approximate counting of depth-2 circuits. In 2nd Israeli Symposium on Theoretical Computer Science (ISTCS), 18-24.
9. J. NAOR & M. NAOR (1993). Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22(4), 838-856. ISSN 0097-5397.
10. A. SAMORODNITSKY (2007). Low-degree tests at large distances. In 39th Annual Symposium on Theory of Computing (STOC), 506-515. ACM.
11. E. VIOLA (2008). The sum of d small-bias generators fools polynomials of degree d. In 23nd Annual Conference on Computational Complexity. IEEE.
12. E. VIOLA (2009). Correlation bounds for polynomials over {0,1}. SIGACT News, Complexity Theory Column (61).