Unconditional pseudorandom generators for low degree polynomials

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 557-562

  Lovett, Shachar ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Fourier analysis; Low degree tests; Pseudorandom generators

Indexed keywords

COMPUTATION THEORY; FOURIER ANALYSIS;

EXPLICIT CONSTRUCTIONS; LOW DEGREE; LOW DEGREE TESTS; POLYNOMIALS OVER FINITE FIELDS; PSEUDORANDOM GENERATORS;

POLYNOMIALS;

EID: 51849085462     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374455     Document Type: Conference Paper

References (17)

1. N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almost k-wise independent random variables. In Random Structures & Algorithms, 3(3):289-304, 1992
2. M. Bellare, D. Coppersmith, J. Hastad, M. Kiwi, and M. Sudan. Linearity testing over characteristic two. In IEEE Transactions on Information Theory, 42(6): 1781-1795, 1996.
3. M. Blum, M. Luby and R, Rubinfeld. Self-Testing/Correcting with Applications to Numerical Problems. In Journal of Computer and System Sciences, 47(3):549-595, 1993
4. A. Bogdanov, Pseudorandom generators for low degree polynomials. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pages 21-30, New York, 2005. ACM.
5. E. Ben-Sasson, M. Sudan, S. Vadhan, and A. Wigderson. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pages 612-621 (electronic),2003.
6. A. Bogdanov and E. Viola. Pseudorandom bits for polynomials via the Gowers norm. In the 48th Annual Symposium on Foundations of Computer Science (FOCS 2007).
7. B. Green and T. Tao. An inverse theorem for the Gowers U3 norm. To appear in Proceedings of the Edinburgh Mathematical Society.
8. B. Green and T. Tao, The distribution of polynomials over finite fields, with applications to the Gowers norms. preprint.
9. S. Lovett, R. Meshulam and A. Samorodnitsky, Inverse Conjecture for the Gowers norm is false. To appear in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC 2008), 2008.
10. 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.
11. 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 (STOC 1990), pages 213-223, 1990.
12. A. Samorodnitsky, Low-degree tests at large distances. In Proceedings of the 39th Annual ACM Symposium on Theory of computing (STOC 2007), pages 506-515, 2007.
13. A. Samorodnitsky and L. Trevisan. Gowers uniformity, influence of variables, and PCPs. In Proceedings of the 38th Annual ACM Symposium on Theory of Computation (STOC 2006), pages 11-20, 2006.
14. E. Viola. New correlation bounds for GF(2) polynomials using Gowers uniformity. In Electronic Colloquium on Computational Complexity, Technical Report TR06-097, 2006. http://www.eccc.uni-trier.de/eccc.
15. E. Viola. Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates. In SIAM Journal on Computing, 36(5):1387-1403, 2007.
16. E. Viola, The sum of d small-bias generators fools polynomials of degree d. To appear in Proceedings of the 23th IEEE Conference on Computational Complexity (CCC), 2008.
17. 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.