23 search results - page 1 / 5 » An algorithmic version of the blow-up lemma |
FOCS
1991
IEEE
13 years 9 months ago
1991
IEEE
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
COCO
2009
Springer
14 years 10 days 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...
RSA
1998
13 years 5 months ago
1998
FOCS
2003
IEEE
13 years 11 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...
FCT
2005
Springer
13 years 11 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...