Deterministic Algorithms for the Lovász Local Lemma
The Lovász local lemma (LLL) [P. Erdös and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets, Vol. II, A. Hajnal, R. Rado, and V. T. Sós, eds., North--Holland, Amsterdam, 1975, pp. 609--627] is a powerful result in probability theory t...
Main Authors: | Chandrasekaran, Karthekeyan, Goyal, Navin, Haeupler, Bernhard |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Society for Industrial and Applied Mathematics
2014
|
Online Access: | http://hdl.handle.net/1721.1/85941 https://orcid.org/0000-0003-3381-0459 |
Similar Items
-
Deterministic algorithms for the Lovász Local Lemma
by: Haeupler, Bernhard
Published: (2010) -
Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models
by: Moitra, Ankur
Published: (2021) -
Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models
by: Moitra, Ankur
Published: (2022) -
Approximate counting, the Lovasz local lemma, and inference in graphical models
by: Moitra, Ankur
Published: (2018) -
Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive
by: Gasarch, William, et al.
Published: (2014)