More deterministic simulation in logspace
From MaRDI portal
Publication:5248491
DOI10.1145/167088.167162zbMath1310.68116OpenAlexW1976907131MaRDI QIDQ5248491
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
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Condensed Unpredictability ⋮ Randomness-efficient non-interactive zero knowledge ⋮ Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker ⋮ Extracting randomness from extractor-dependent sources ⋮ \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\) ⋮ Extracting randomness: A survey and new constructions
