scientific article; zbMATH DE number 1820025

MaRDI QIDQ3152808zbMATH OpenFDO

Authors Valentine Kabanets

Publication date 23 October 2002

zbMATH Keywords

derandomization

Mathematics Subject Classification ID

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

Cited in

(8)

• Derandomizing Knockoffs
• In search of an easy witness: Exponential time vs. probabilistic polynomial time.
• Random oracles and non-uniformity
• scientific article; zbMATH DE number 5926399 (Why is no real title available?)
• scientific article; zbMATH DE number 1962815 (Why is no real title available?)
• Weak derandomization of weak algorithms: explicit versions of Yao's lemma
• Reconstructive dispersers and hitting set generators
• How strong is Nisan's pseudo-random generator?

This page was built for publication:

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