Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovász Local Lemma

DOI10.1137/1.9781611973730.120zbMath1372.68192arXiv1610.02420OpenAlexW2953385120MaRDI QIDQ5363066

David G. Harris

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.02420

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Combinatorial probability (60C05) Parallel algorithms in computer science (68W10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ Directed Lovász local lemma and Shearer's lemma ⋮ Distributed algorithms for the Lovász local lemma and graph coloring

This page was built for publication: Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovász Local Lemma