Sciweavers

Share
2 search results - page 1 / 1
» Weak Derandomization of Weak Algorithms: Explicit Versions o...
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
9 years 4 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
FOCS
2003
IEEE
9 years 3 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
books