On recycling the randomness of states in space bounded computation

DOI10.1145/301250.301294zbMath1345.68135OpenAlexW2073445540MaRDI QIDQ2819543

Omer Reingold, Ran Raz

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Related Items (17)

No time to hash: on super-efficient entropy accumulation ⋮ Pseudorandomness via the Discrete Fourier Transform ⋮ On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs ⋮ Preserving Randomness for Adaptive Algorithms ⋮ Improved Explicit Hitting-Sets for ROABPs ⋮ Unnamed Item ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors ⋮ On the distribution of the number of roots of polynomials and explicit weak designs ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Big-Key Symmetric Encryption: Resisting Key Exfiltration ⋮ Optimal $\varepsilon$-Biased Sets with Just a Little Randomness ⋮ Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace ⋮ Security analysis of NIST CTR-DRBG ⋮ Storing information with extractors.

This page was built for publication: On recycling the randomness of states in space bounded computation