Comparison of two convergence criteria for the variable-assignment Lopsided Lovász Local Lemma
From MaRDI portal
Publication:2094876
DOI10.37236/9899OpenAlexW2805256348WikidataQ124999221 ScholiaQ124999221MaRDI QIDQ2094876
Publication date: 8 November 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.01926
Cites Work
- Disproof of the neighborhood conjecture with implications to SAT
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable
- Lopsided Lovász Local lemma and Latin transversals
- Using Lovász local lemma in the space of random injections
- On a problem of Spencer
- Hypergraph colouring and the Lovász local lemma
- DNF tautologies with a limited number of occurrences of every variable
- Multicoloured Hamilton cycles
- An Improvement of the Lovász Local Lemma via Cluster Expansion
- A Sharper Local Lemma with Improved Applications
- The Local Lemma Is Asymptotically Tight for SAT
- A constructive proof of the general lovász local lemma
- One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete
- Lopsidependency in the Moser-Tardos Framework
- Quantum Lovász local lemma: Shearer’s bound is tight
- Moser and tardos meet Lovász