Amanote Research
Register
Sign In
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
doi 10.1109/ccc.2009.27
Full Text
Open PDF
Abstract
Available in
full text
Date
July 1, 2009
Authors
Ronen Shaltiel
Publisher
IEEE
Related search
Parallel and Serial Jumps of Weak Weak König’s Lemma
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On the Uniform Weak König’s Lemma
BRICS Report Series
Confluence Properties of Weak and Strong Calculi of Explicit Substitutions
Journal of the ACM
Control
Systems Engineering
Information Systems
Hardware
Architecture
Artificial Intelligence
Software
Weak*-Weak* Continuous Derivations
International Mathematical Forum
Weak Selections and Weak Orderability of Function Spaces
Czechoslovak Mathematical Journal
Mathematics
Weak W-Continuity on Weak Spaces
International Journal of Mathematical Analysis
Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Introduction to Weak Measurements and Weak Values
Quanta
Molecular Physics,
Mathematical Physics
Atomic
History
Optics
Philosophy of Science
Weak Measurements: Typical Weak and Superweak Values
Current Science
Multidisciplinary
