Deterministic amplification of space-bounded probabilistic algorithms

Ziv Bar-Yossef*, Oded Goldreich, Avi Wigderson

*Corresponding author for this work

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

9 Scopus citations

Abstract

The deterministic amplification of space-bounded probabilistic algorithms is addressed. A new implementation of the Ajtai-Komlos-Szemeredi method is presented. The new implementation enables to amplify an S-space algorithm that uses r random bits and errors with probability qq to an O (kS)-space algorithm that uses r+O (k) random bits and errors with probability qqΩ(k).

Original languageEnglish
Title of host publicationProceedings of the Annual IEEE Conference on Computational Complexity
PublisherIEEE Comp Soc
Pages188-198
Number of pages11
ISBN (Print)0769500757
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 14th Annual IEEE Conference on Computational Complexity - Atlanta, GA, USA
Duration: 4 May 19996 May 1999

Publication series

NameProceedings of the Annual IEEE Conference on Computational Complexity
ISSN (Print)1093-0159

Conference

ConferenceProceedings of the 1999 14th Annual IEEE Conference on Computational Complexity
CityAtlanta, GA, USA
Period4/05/996/05/99

Fingerprint

Dive into the research topics of 'Deterministic amplification of space-bounded probabilistic algorithms'. Together they form a unique fingerprint.

Cite this