More deterministic simulation in logspace

DOI10.1145/167088.167162MaRDI QIDQ5248491zbMATH OpenOpenAlexFDO

Authors Noam Nisan, David Zuckerman

Publication date 7 May 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/167088.167162

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cited in

(6)

• \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
• Extracting randomness: A survey and new constructions
• Extracting randomness from extractor-dependent sources
• Condensed Unpredictability
• Randomness-efficient non-interactive zero knowledge
• Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker

This page was built for publication: More deterministic simulation in logspace

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248491)