Construct · 1 fields · 1 citations

algorithmic Lovász local lemma: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
algorithmicLovász local lemma1 CONSTRUCTAlgorithmic Lovász localMOSER · RANDOMIZED ALGORITHMS

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Randomized algorithms

the result that resampling the variables of violated bad events finds, in expected polynomial time, an outcome the local lemma promises exists.

In randomized algorithms, algorithmic Lovász local lemma refers to the result that resampling the variables of violated bad events finds, in expected polynomial time, an outcome the local lemma promises exists. This meaning comes from Moser (2010) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how algorithmic Lovász local lemma sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

Lovász local lemma1 fields · 1 citationsanchor · a standalone constructlemma1 fields · 3 citationsanchor · a standalone construct

References

  1. Moser, R. A., & Tardos, G. (2010). A constructive proof of the general lovász local lemma. Journal of the ACM, 57(2), 1-15. https://doi.org/10.1145/1667053.1667060

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct