Pseudorandom bits for polynomials

SIAM Journal on Computing

Volumn 39, Issue 6, 2010, Pages 2464-2486

  Bogdanov, Andrej ^a   Viola, Emanuele ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b Northeastern University   (United States)

Author keywords

Bias; Degree; Gowers norm; Polynomial; Pseudorandom generator

Indexed keywords

APPROXIMATE COUNTING; BIAS; FINITE FIELDS; GOWERS NORM; NEW APPROACHES; PSEUDORANDOM BITS; PSEUDORANDOM GENERATORS; THEORETICAL COMPUTER SCIENCE;

COMPUTER SCIENCE; SEED;

POLYNOMIALS;

EID: 77952257894     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070712109     Document Type: Article

References (27)

1. N. ALON, I. BEN-ELIEZER, AND M. KRIVELEVICH, Small sample spaces cannot fool low degree polynomials, in Proceedings of the 12th Workshop on Randomization and Computation (RANDOM), Boston, MA, Springer, Berlin, 2008, pp. 266-275.
2. N. ALON, J. BRUCK, J. NAOR, M. NAOR, AND R. M. ROTH, Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs., IEEE Trans. Inform. Theory, 38 (1992), pp. 509-516.
3. N. ALON, O. GOLDREICH, J. HÅSTAD, AND R. P ERALTA, Simple constructions of almost κ-wise independent random variables, Random Structures Algorithms, 3 (1992), pp. 289-304.
4. N. ALON, T. KAUFMAN, M. KRIVELEVICH, S. LITSYN, AND D. RON, Testing low- degree polynomials over GF(2), in Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), Princeton, NJ, Lecture Notes in Comput. Sci. 2764, Springer, Berlin, 2003, pp. 188-199.
5. L. BABAI, N. NISAN, AND M. SZEGEDY, Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs, J. Comput. System Sci., 45 (1992), pp. 204-232.
6. 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 Symposium on Theory of Computing (S TOC), San Diego, CA, ACM, 2003, pp. 612-621.
7. C. BERTRAM-KRETZBERG AND H. LEFMANN, Modp-tests, almost independence and small probability spaces., Random Structures Algorithms, 16 (2000), pp. 293-313.
8. A. BOGDANOV, Pseudorandom generators for low degree polynomials, in Proceedings of the 37th Annual Symposium on Theory of C omputing (STOC), Baltimore, MD, ACM, 2005, pp. 21-30.
9. A. BOGDANOV AND E. VIOLA, Pseudorandom bits for polynomials, in Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS), Providence, RI, IEEE, 2007, pp. 41-51.
10. D. DUBHASHI AND A. PANCONESI, Concentration of Measure for the Analysis of Randomised Algorithms, http://www.dsi.uniroma1.it/~ale/papers.html (2005).
11. O. GOLDREICH, Modern Cryptography, Probabilistic Proofs and Pseudorandomness, Algorithms Combin. 17, Springer, Berlin, 1999.
12. T. GOWERS, Anew proof ofSzemerédi's theorem for arithmetic progressions of length four, Geom. Funct. Anal., 8 (1998), pp. 529-551.
13. T. GOWERS, Anew proof of Szemerédi's theorem, Geom. Funct. Anal., 11 (2001), pp. 465-588.
14. B. GREEN AND T. TAO, The Distribution of Polynomials over Finite Fields, With Applications to the Gowers Norms, UCLA, Los Angeles, 2007.
15. 3(G) norm,Proc. Edinb. Math. Soc. (2), 51 (2008), pp. 73-153.
16. R. LIDL AND H. NIEDERREITER, Finite Fields, Encyclopedia Math. Appl. 20, 2nd ed., Cambridge University Press, Cambridge, 1997.
17. S. LOVETT, Unconditional pseudorandom generators for low degree polynomials, Theory Comput., 5 (2009), pp. 69-82.
18. S. LOVETT, R. MESHULAM, AND A. SAMORODNITSKY, Inverse conjecture for the Gowers norm is false, in Proceedings of the 40th Annual Symposium on the Theory of Computing (STOC), Victoria, BC, Canada, ACM, 2008, pp. 547-556.
19. M. LUBY, B. VELIČKOVIĆ, AND A. WIGDERSON , Deterministic approximate counting of depth-2 circuits, in Proceedings of the 2nd Israeli Symposium on Theoretical Computer Science (ISTCS), Natanya, Israel, IEEE, 1993, pp. 18-24.
20. J. NAOR AND M. NAOR, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22 (1993), pp. 838-856.
21. A. SAMORODNITSKY, Low-degree tests at large distances, in Proceedings of the 39th Annual Symposium on Theory of Computing (STOC), San Diego, CA, ACM, 2007, pp. 506-515.
22. A. SAMORODNITSKY AND L. TREVISAN, Gowers uniformity, influence of variables, and PCPs, in Proceedings of the 38th Symposium on Theory of Computing (STOC), Seattle, WA, ACM, 2006, pp. 11-20.
23. V. SHOUP, New algorithms for finding irreducible polynomials over finite fields, Math. Comp. 54 (1990), pp. 435-447.
24. E. VIOLA, New Correlation Bounds for GF(2) Polynomials Using Gowers Uniformity. Electronic Colloquium on Computational Complexity, Technical report TR06- 097, 2006.
25. E. VIOLA, Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates, SIAM J. Comput., 36 (2007), pp. 1387-1403. (Pubitemid 47632452)
26. E. VIOLA, The sum of d small-bias generators fools polynomials of degreed, in Proceedings of the 23rd Annual Conference on Computational Complexity, College Park, MD, IEEE, 2008.
27. E. VIOLA AND A. WIGDERSON, Norms, XOR lemmas, and lower bounds for GF(2) polynomials and multiparty protocols, Theory Comput. 4 (2008), pp. 137-168.