A new general derandomization method
From MaRDI portal
Publication:3841044
DOI10.1145/273865.273933zbMath0903.68089OpenAlexW2025819235MaRDI QIDQ3841044
Andrea E. F. Clementi, Alexander E. Andreev, José D. P. Rolim
Publication date: 5 January 1999
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1998-45/
Related Items (11)
In search of an easy witness: Exponential time vs. probabilistic polynomial time. ⋮ Reconstructive dispersers and hitting set generators ⋮ The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs ⋮ Small-bias is not enough to hit read-once CNF ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Pseudo-random generators for all hardnesses ⋮ Simplified Derandomization of BPP Using a Hitting Set Generator ⋮ Randomness vs time: Derandomization under a uniform assumption
This page was built for publication: A new general derandomization method
