Pseudorandom generators for space-bounded computation

Noam Nisan*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

306 Scopus citations

Abstract

Pseudorandom generators are constructed which convert O(Slog R) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). In particular, any randomized polynomial time algorithm that runs in space S can be simulated using only O(Slog n) random bits. An application of these generators is an explicit construction of universal traversal sequences (for arbitrary graphs) of length nO(log n). 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.

Original languageAmerican English
Pages (from-to)449-461
Number of pages13
JournalCombinatorica
Volume12
Issue number4
DOIs
StatePublished - Dec 1992

Keywords

  • AMS subject classification code (1991): 68Q15

Fingerprint

Dive into the research topics of 'Pseudorandom generators for space-bounded computation'. Together they form a unique fingerprint.

Cite this