2 search results - page 1 / 1 » Weak Derandomization of Weak Algorithms: Explicit Versions o... |
COCO
2009
Springer
14 years 5 months ago
2009
Springer
—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...
FOCS
2003
IEEE
14 years 4 months ago
2003
IEEE
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...