Pseudorandom Generators and Typically-Correct Derandomization

DOI10.1007/978-3-642-03685-9_43MaRDI QIDQ3638904zbMATH OpenOpenAlexFDO

Authors Jeff Kinne, Dieter Van Melkebeek, Ronen Shaltiel

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)

Recommendations

• Pseudorandom generators, typically-correct derandomization, and circuit lower bounds
• scientific article; zbMATH DE number 4182679
• On the Existence of Pseudorandom Generators
• A primer on pseudorandom generators
• An asymptotically perfect pseudorandom generator
• Stochastic investigations of pseudo-random number generators
• scientific article; zbMATH DE number 2086718
• Pseudorandomness
• Pseudorandomness
• scientific article; zbMATH DE number 1670863

Cited in

(20)

• An asymptotically perfect pseudorandom generator
• Cryptographic pseudorandom generators can make cryptosystems problematic
• Pseudorandom generators and the frequency of simplicity
• scientific article; zbMATH DE number 6687661 (Why is no real title available?)
• An introduction to randomness extractors
• Pseudorandom generators for combinatorial checkerboards
• scientific article; zbMATH DE number 17389 (Why is no real title available?)
• Pseudorandom generators, typically-correct derandomization, and circuit lower bounds
• scientific article; zbMATH DE number 2019636 (Why is no real title available?)
• Weak derandomization of weak algorithms: explicit versions of Yao's lemma
• scientific article; zbMATH DE number 7528580 (Why is no real title available?)
• Typically-correct derandomization for small time and space
• scientific article; zbMATH DE number 7250141 (Why is no real title available?)
• Dimension, Pseudorandomness and Extraction of Pseudorandomness
• scientific article; zbMATH DE number 4182679 (Why is no real title available?)
• Efficient Pseudorandom Generators Based on the DDH Assumption
• Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
• Pseudo-random generators for all hardnesses
• Derandomizing Knockoffs
• Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638904)