An Extension of the Moser--Tardos Algorithmic Local Lemma
From MaRDI portal
Publication:3192170
DOI10.1137/110828290zbMath1301.60013arXiv1102.2853OpenAlexW2963097814WikidataQ124877411 ScholiaQ124877411MaRDI QIDQ3192170
Publication date: 26 September 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.2853
Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (14)
Commutativity in the Algorithmic Lovász Local Lemma ⋮ Virial series for a system of classical particles interacting through a pair potential with negative minimum ⋮ Rainbow Hamilton cycles and lopsidependency ⋮ Extremal bipartite independence number and balanced coloring ⋮ Moser-Tardos resampling algorithm, entropy compression method and the subset gas ⋮ Unnamed Item ⋮ New bounds for the Moser‐Tardos distribution ⋮ Entropy compression versus Lovász local lemma ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas ⋮ Distributed algorithms for the Lovász local lemma and graph coloring ⋮ Finding independent transversals efficiently ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ The local cut lemma
This page was built for publication: An Extension of the Moser--Tardos Algorithmic Local Lemma
