Can every randomized algorithm be derandomized?

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 373-374

  Impagliazzo, Russell ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algebraic circuit complexity; Circuit complexity; Complexity classes; Derandomization; Probabilistic algorithms; Pseudo randomness

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECISION THEORY; ERROR CORRECTION; PROBLEM SOLVING;

ALGEBRAIC CIRCUIT COMPLEXITY; CIRCUIT COMPLEXITY; COMPLEXITY CLASSES; DERANDOMIZATION; PROBABILISTIC ALGORITHMS; PSEUDO RANDOMNESS;

ALGORITHMS;

EID: 33748123216     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132571     Document Type: Conference Paper

References (31)

1. M. Agrawal, N. Kayal, and N. Saxena, Primes is in P. Annals of Mathematics, Vol. 160, No. 2, 2004, pp. 781-793.
2. R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Rackoff, Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems 20th FOCS, 1979, pp. 218-223.
3. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Complexity, 3:307-318, 1993.
4. E.R. Berlekamp. Factoring Polynomials. Proc. of the 3rd Southeastern Conference on Combinatorics, GRAPH THEORY AND COMPUTING 1972, pp. 1-7.
5. M. Blum and S. Micali. quot;How to Generate Cryptographically Strong Sequences of Pseudo-Random Bitsquot;, SIAM J. Comput., Vol. 13, pages 850-864, 1984.
6. R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: Exponential time vs. probabilistic polynomial time. In Proceedings of the Sixteenth Annual IEEE Conference on Computational Complexity, pages 1-11, 2001.
7. R. Impagliazzo and A. Wigderson. P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 220-229, 1997.
8. R. Impagliazzo and A. Wigderson. Randomness vs. time: De-randomization under a uniform assumption. In Proceedings of the Thirty-Ninth Annual IEEE Symposium on Foundations of Computer Science, pages 734-743, 1998.
9. D. Johnson, The NP-completeness column: An ongoing guide. (12th article) Journal of Algorithms, Vol. 5, 1984, pp. 433-447.
10. V. Kabanets and R. Impagliazzo, Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds Computational Complexity, Vol. 13, No. 1-2, 2004, pp. 1-46.
11. L. A. Levin, One-Way Functions and Pseudorandom Generators. Combinatorica, Vol. 7, No, 4, pp. 357-363, 1987.
12. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
13. N. Nisan and D. Zuckerman. Randomness is Linear in Space. JCSS, Vol 52, No. 1, 1996, pp. 43-52.
14. M. O. Rabin. Probabilistic Algorithm for Testing Primality. Journal of Number Theory, 12:128-138, 1980.
15. O. Reingold. Undirected ST-connectivity in log-space. STOC '05, pp. 376-385, 2005
16. M. Santha and U. V. Vazirani, Generating Quasi-Random Sequences from Slightly Random Sources, 25ih FOCS, 1984, pp. 434-440.
17. J.T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the Association for Computing Machinery, 27(4):701-717, 1980.
18. R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of the Forty-Second Annual IEEE Symposium on Foundations of Computer Science, pages 648-657, 2001.
19. M. Sipser Extractors, Randomness, or Time versus Space. JCSS, vol 36, No, 3, 1988, pp. 379-383.
20. R. Solovay and V. Strassen, A fast Monte Carlo test for primality SIAM Journal on Computing 6(1):84-85, 1979.
21. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma, Journal of Computer and System Sciences, 62(2):236-266, 2001. (preliminary version in STOC'99).
22. M. Sudan. Decoding of Reed Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180-193, 1997.
23. L. Trevisan. Extractors and pseudorandom generators. Journal of the Association for Computing Machinery, 48(4):860-879, 2001. (preliminary version in STOC'99).
24. L. Trevisan, List Decoding Using the XOR Lemma. Electronic Colloquium on Computational Complexity tech report 03-042, 2003.
25. C. Umans. Pseudo-random generators for all hardnesses. In Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, 2002.
26. L. Valiant. Why is Boolean complexity theory difficult? In M.S. Paterson, editor, Boolean Function Complexity, volume 169 of London Math. Society Lecture Note Series, pages 84-94. Cambridge University Press, 1992.
27. J. von Neumann, Various Techniques Used in Relation to Random Digits Applied Math Series, Vol. 12, 1951, pp. 36-38.
28. A.C. Yao. Theory and applications of trapdoor functions. In Proceedings of the Twenty-Third Annual IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.
29. R.E. Zippel. Probabilistic algorithms for sparse polynomials. In Proceedings of an International Symposium on Symbolic and Algebraic Manipulation (EUROSAM'79), Lecture Notes in Computer Science, pages 216-226, 1979.
30. D. Zuckerman, General Weak Random Sources 31st FOCS, 1990, pp. 534-543.
31. D. Zuckerman, Simulating BPP Using a General Weak Random Source, FOCS, 1991, pp. 79-89.