On the derandomization of space-bounded computations

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

Volumn 1518, Issue , 1998, Pages 47-59

  Armoni, Roy ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOUNDED COMPUTATION; DERANDOMIZATION; PSEUDORANDOM GENERATORS; RANDOM BITS;

RANDOM PROCESSES;

EID: 84958624495     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49543-6_5     Document Type: Conference Paper

References (7)

1. 4/3. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC), pages 230-239, 1997.
2. Mihir Bellare, Oded Goldreich, and Sha Goldwasser. Randomness in interactive proofs. Computational Complexity, 3(4):319-354, 1993.
3. Russel Impagliazzo, Noam Nisan, and Avi Wigderson. Pseudorandomness for network algorithms. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC), pages 356-364, Montreal, Quebec, Canada, May 1994.
4. Noam Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, June 1992.
5. Noam Nisan and David Zuckerman. More deterministic simulation in logspace. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC), pages 235-244, San Diego, CA, May 1993.
6. 3/2). In 36th Annual Symposium on Foundations of Computer Science (FOCS), pages 344-353, Milwaukee, Wisconsin, October 1995. To appear in JCSS.
7. David Zuckerman. Randomness-optimal sampling, extractors, and constructive leader election. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC), pages 286-295, Philadelphia, Pennsylvania, May 1996.