Proving lower bounds via pseudo-random generators

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3821 LNCS, Issue , 2005, Pages 92-105

  Agrawal, Manindra ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC ANALOG; ARITHMETIC CIRCUITS; LOWER BOUNDS; PSEUDO-RANDOM GENERATORS;

COMPUTER SCIENCE; COMPUTER SYSTEMS; DIGITAL ARITHMETIC; INFORMATION TECHNOLOGY; RANDOM PROCESSES;

ARTIFICIAL INTELLIGENCE;

EID: 33744932957     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_6     Document Type: Conference Paper

References (24)

1. Manindra Agrawal. On derandomizing tests for certain polynomial identities. In Proceedings of the Conference on Computational Complexity, pages 355-362, 2003.
2. Manindra Agrawal, Neeraj Kayal, and Nitin Saxena. PRIMES is in P. Annals of Mathematics, 160(2):781-793, 2004.
3. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pages 544-553, 1990.
4. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13:850-864, 1984.
5. C. Damm. DET=L#l. Technical Report Informatik-preprint 8, Fachbereich Informatik der Humboldt Universität zu Berlin, 1991.
6. L. Fortnow. The role of relativization in complexity theory. Bulletin of the European Association for Theoretical Computer Science, 1994. Complexity Theory Column.
7. L. Fortnow. Time-space tradeoffs for satisfiability. J. Compul. Sys. Sci., 60(2):337-353, 2000.
8. J. Håstad. Computational limitations on small depth circuits. PhD thesis, Massachusetts Institute of Technology, 1986.
9. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudo-random generator from any one-way function. SIAM Journal on Computing, pages 221-243, 1998.
10. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 220-229, 1997.
11. Valentine Kabanets and Russell Impagliazzo. Derandomizing polyonmial identity tests means proving circuit lower bounds. In Proceedings of Annual. ACM Symposium on the Theory of Computing, pages 355-364, 2003.
12. K. Mulmuley and M. Sohoni. Geometric complexity theory I: An approach to the P vs. NP and other related problems. SIAM Journal on Computing, 31(2):496-526, 2002.
13. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 213-223, 1990.
14. N. Nisan and A. Wigderson. Hardness vs. randomness. J. Comput. Sys. Sci., 49(2):149-167, 1994.
15. A. Razborov. Lower bounds for the monotone complexity of some boolean functions. Doklady Akademii Nauk SSSR, 281(4):798-801, 1985.
16. English translation in Soviet Math. Doklady, 31:354-357, 1985.
17. A. Razborov and S. Rudich. Natural proofs. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 204-213, 1994.
18. O. Reingold. Undirected s-t-connectivity in logspace. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 376-385, 2005.
19. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(4):701-717, 1980.
20. S. Toda. Counting problems computationally equivalent to the determinant, manuscript, 1991.
21. L. Valiant, S. Skyum, S. Berkowitss, and C. Rackoff, Fast parallel computation of polynnomials using few processors. SIAM Journal on Computing, 12:641-644, 1983.
22. V Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proceedings of the Structure in Complexity Theory Conference, pages 270-284. Springer LNCS 223, 1991.
23. A. C. Yao. Theory and applications of trapdoor functions. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.
24. R. E. Zippel. Probabilistic algorithms for sparse polynomials. In EUROSCAM'79, pages 216-226. Springer LNCS 72, 1979.