Pseudorandom Generators and Typically-Correct Derandomization

DOI10.1007/978-3-642-03685-9_43zbMath1255.68292OpenAlexW1500475012MaRDI QIDQ3638904

Ronen Shaltiel, Dieter van Melkebeek, Jeff Kinne

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_43

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)

Related Items (3)

Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds ⋮ Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ An Introduction to Randomness Extractors

This page was built for publication: Pseudorandom Generators and Typically-Correct Derandomization