Pseudorandom generators for space-bounded computation

Noam Nisan*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

88 Scopus citations

Abstract

Pseudorandom generators are constructed which convert O(S log 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(S log 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
Title of host publicationProc 22nd Annu ACM Symp Theory Comput
PublisherPubl by ACM
Pages204-212
Number of pages9
ISBN (Print)0897913612
StatePublished - 1990
Externally publishedYes
EventProceedings of the 22nd Annual ACM Symposium on Theory of Computing - Baltimore, MD, USA
Duration: 14 May 199016 May 1990

Publication series

NameProc 22nd Annu ACM Symp Theory Comput

Conference

ConferenceProceedings of the 22nd Annual ACM Symposium on Theory of Computing
CityBaltimore, MD, USA
Period14/05/9016/05/90

Fingerprint

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

Cite this