Pseudorandom generators for low degree polynomials

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 21-30

  Bogdanov, Andrej ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Derandomization; Pseudorandomness

Indexed keywords

ARITHMETIC CIRCUITS; DERANDOMIZATION; PSEUDORANDOMNESS;

POLYNOMIALS; SET THEORY;

RANDOM NUMBER GENERATION;

EID: 34848892168     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060594     Document Type: Conference Paper

References (23)

1. N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almost K-wise independent random variables. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pages 544-553, 1990.
2. A. Andreev, A. Clementi, and J. Rolim. A new general derandomization method. Journal of the ACM, 45(1):179-213, 1998.
3. 0. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pages 166-175, 2004.
4. 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 ACM Symposium on Theory of Computing, pages 612-621, 2003.
5. A. Cafure and G. Matera. Improved explicit estimates on the number of solutions of equations over a finite field. arXiv:math.NT/0405302 v1, 2004.
6. 0. In Proceedings of the MFCS'01, 2001.
7. M. D. Huang and Y. C. Wong. Solvability of systems of polynomial congruences modulo a large prime. Computational Complexity, 8:227-257, 1999.
8. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. In Proceedings of the 35th ACM Symposium on Theory of Computing, pages 355-364, 2003.
9. E. Kaltofen. Effective noether irreducibility forms and applications. Jornal of Computer and System Sciences, 50(2):274-295, 1995.
10. S. Kalyanaraman and C. Umans. On obtaining pseudorandomness from error-correcting codes. Manuscript, 2005.
11. A. Klivans and D. Spielman. Randomness efficient identity testing. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 216-223, 2001.
12. S. Lang. Algebra. Addison-Wesley, Third edition, 1993.
13. M. Luby, B. Veličković, and A. Wigderson. Deterministic approximate counting of depth-2 circuits. In Proceedings of the 2nd Israeli Symposium on Theory of Computing and Systems, pages 18-24, 1993.
14. F. MacWilliams and N. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1977.
15. o- In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pages 136-145, 2003.
16. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. In Proceedings of the 22nd ACM Symposium on Theory of Computing, pages 213-223, 1990.
17. N. Nisan and A. Wigderson. Hardness vs. randomness. Jornal of Computer and System Sciences, 49(2):149-167, 1994.
18. W. A. Schmidt. Zur methode von Stepanov. Acta Arithmetica, 24:247-267, 1973.
19. W. M. Schmidt. A lower bound for the number of solutions of equations over finite fields. Journal of Number Theory, 6(6):448-480, 1974.
20. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4):701-717, 1980.
21. E. Viola. Pseudorandom bits for constant depth circuits with one arbitrary symmetric gate. In Proceedings of the 20th IEEE Conference on Computational Complexity, 2005. To appear.
22. A. Weil. Sur les courbes algébriques et les variétés qui s'en déduisent. Actualites Scientifiques et Industrielles, 1041, 1948.
23. R. E. Zippel. Probabilistic algorithms for sparse polynomials. In Proceedings of EUROSAM 79, pages 216-226, 1979.