Pseudo-random generators for all hardnesses

DOI10.1145/509907.509997zbMath1192.68863OpenAlexW1572772224MaRDI QIDQ5901058

Christopher Umans

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Randomized algorithms (68W20)

Related Items (2)

Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ Extractors from Reed-Muller codes

This page was built for publication: Pseudo-random generators for all hardnesses