, Volume 12, Issue 4, pp 449–461

Pseudorandom generators for space-bounded computation

  • Noam Nisan

DOI: 10.1007/BF01305237

Cite this article as:
Nisan, N. Combinatorica (1992) 12: 449. doi:10.1007/BF01305237


Pseudorandom generators are constructed which convertO(SlogR) truly random bits toR bits that appear random to any algorithm that runs inSPACE(S). In particular, any randomized polynomial time algorithm that runs in spaceS can be simulated using onlyO(Slogn) random bits. An application of these generators is an explicit construction of universal traversal sequences (for arbitrary graphs) of lengthnO(logn).

The generators constructed are technically stronger than just appearing random to spacebounded machines, and have several other applications. In particular, applications are given for “deterministic amplification” (i.e. reducing the probability of error of randomized algorithms), as well as generalizations of it.

AMS subject classification code (1991)

68 Q 15 

Copyright information

© Akadémiai Kiadó 1992

Authors and Affiliations

  • Noam Nisan
    • 1
  1. 1.Department of Computer ScienceHebrew University of JerusalemJerusalemIsrael

Personalised recommendations