More deterministic simulation in logspace

Noam Nisan, David Zuckerman

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

50 Scopus citations

Abstract

We show that any randomized space(S) algorithm which uses only poly(S) random bits can be simulated deterministically in space(S), for 5(n) > logn. Of independent interest is our main technical tool: A procedure which extracts randomness from a defective random source using a small additional number of truly random bits.

Original languageAmerican English
Title of host publicationProceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993
PublisherAssociation for Computing Machinery
Pages235-244
Number of pages10
ISBN (Electronic)0897915917
DOIs
StatePublished - 1 Jun 1993
Event25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States
Duration: 16 May 199318 May 1993

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129585
ISSN (Print)0737-8017

Conference

Conference25th Annual ACM Symposium on Theory of Computing, STOC 1993
Country/TerritoryUnited States
CitySan Diego
Period16/05/9318/05/93

Bibliographical note

Publisher Copyright:
© 1993 ACM.

Cite this