Extracting Randomness via Repeated Condensing
From MaRDI portal
Publication:5470730
DOI10.1137/S0097539703431032zbMath1100.68030MaRDI QIDQ5470730
Omer Reingold, Avi Wigderson, Ronen Shaltiel
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Randomized algorithms (68W20)
Related Items (8)
No time to hash: on super-efficient entropy accumulation ⋮ 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction ⋮ Constant time parallel sorting: An empirical view. ⋮ Variations on Muchnik's conditional complexity theorem ⋮ Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive derandomization ⋮ Extractors from Reed-Muller codes ⋮ Extracting Kolmogorov complexity with applications to dimension zero-one laws ⋮ Big-Key Symmetric Encryption: Resisting Key Exfiltration
This page was built for publication: Extracting Randomness via Repeated Condensing
