Time-space tradeoff in derandomizing probabilistic logspace

Theory of Computing Systems

Volumn 39, Issue 1, 2006, Pages 189-208

  Cai, Jin Yi ^a   Chakaravarthy, Venkatesan T ^a   Van Melkebeek, Dieter ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DERANDOMIZING; DETERMINISTIC ALGORITHMS; DETERMINISTIC SIMULATION; POLYNOMIAL-TIME; RUNNING-IN; SPACE ALGORITHMS; SPACE COMPLEXITY; TIME-SPACE TRADEOFFS;

ALGORITHMS;

POLYNOMIAL APPROXIMATION;

EID: 30744434105     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-005-1264-9     Document Type: Conference Paper

References (9)

1. R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal travel sequences and the complexity of maze problems. In Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pages 218-223, 1979.
2. L. Carter and M. Wegman. Universal hash functions. Journal of Computer and System Sciences, 18:143-154, 1979.
3. A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses. SIAM Journal on Computing, 31(5):1501-1526, 2002.
4. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
5. N. Nisan. RL⊆ SC. Computational Complexity, 4:1-11, 1994.
6. O. Reingold. Undirected st-connectivity in log-space. In Proceedings of the 37th ACM Symposium on Theory of Computing, pages 376-385, 2005.
7. M. Saks. Randomization and derandomization in space bounded computation. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 128-149, 1996.
8. 3/2). Journal of Computer and System Sciences, 58:376-403, 1999.
9. W. J. Savitch. Relationships between nondeterministic and deterministic space complexities. Journal of Computer and System Sciences, 4(2):177-192, 1970.