scientific article; zbMATH DE number 1820025

zbMATH Open1021.68041MaRDI QIDQ3152808FDOQ3152808

Authors: Valentine Kabanets 

Publication date: 23 October 2002

Title of this publication is not available (Why is that?)

zbMATH Keywords

derandomization

Mathematics Subject Classification ID

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

Cited In (8)

• In search of an easy witness: Exponential time vs. probabilistic polynomial time.
• Random oracles and non-uniformity
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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?
• Derandomizing Knockoffs

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)