TY - GEN

T1 - Deterministic algorithms for the Lovász Local Lemma

AU - Chandrasekaran, Karthekeyan

AU - Goyal, Navin

AU - Haeupler, Bernhard

N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2010

Y1 - 2010

N2 - The Lovász Local Lemma [5] (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that depend on it. It is often used in combination with the probabilistic method for non-constructive existence proofs. A prominent application is to k-CNF formulas, where LLL implies that, if every clause in the formula shares variables with at most d ≤ 2k /e other clauses then such a formula has a satisfying assignment. Recently, a randomized algorithm to efficiently construct a satisfying assignment was given by Moser [13]. Subsequently Moser and Tardos [14] gave a randomized algorithm to construct the structures guaranteed by the LLL in a very general algorithmic framework. We address the main problem left open by Moser and Tardos of derandomizing these algorithms efficiently. Specifically, for a k-CNF formula with m clauses and d ≤ 2k/(1+∈) / e for some ∈ ∈ (0, 1), we give an algorithm that finds a satisfying assignment in time Õ(m2(1+1/∈))). This improves upon the deterministic algorithms of Moser and of Moser-Tardos with running times m Ω(k2) and mΩ(k·1/∈) which are superpolynomial for k = ω(1) and upon other previous algorithms which work only for d ≤ 2k/16/e. Our algorithm works efficiently for the asymmetric version of LLL under the algorithmic framework of Moser and Tardos [14] and is also parallelizable, i.e., has polylogarithmic running time using polynomially many processors.

AB - The Lovász Local Lemma [5] (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that depend on it. It is often used in combination with the probabilistic method for non-constructive existence proofs. A prominent application is to k-CNF formulas, where LLL implies that, if every clause in the formula shares variables with at most d ≤ 2k /e other clauses then such a formula has a satisfying assignment. Recently, a randomized algorithm to efficiently construct a satisfying assignment was given by Moser [13]. Subsequently Moser and Tardos [14] gave a randomized algorithm to construct the structures guaranteed by the LLL in a very general algorithmic framework. We address the main problem left open by Moser and Tardos of derandomizing these algorithms efficiently. Specifically, for a k-CNF formula with m clauses and d ≤ 2k/(1+∈) / e for some ∈ ∈ (0, 1), we give an algorithm that finds a satisfying assignment in time Õ(m2(1+1/∈))). This improves upon the deterministic algorithms of Moser and of Moser-Tardos with running times m Ω(k2) and mΩ(k·1/∈) which are superpolynomial for k = ω(1) and upon other previous algorithms which work only for d ≤ 2k/16/e. Our algorithm works efficiently for the asymmetric version of LLL under the algorithmic framework of Moser and Tardos [14] and is also parallelizable, i.e., has polylogarithmic running time using polynomially many processors.

UR - http://www.scopus.com/inward/record.url?scp=76849092743&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=76849092743&partnerID=8YFLogxK

U2 - 10.1137/1.9781611973075.80

DO - 10.1137/1.9781611973075.80

M3 - Conference contribution

AN - SCOPUS:76849092743

SN - 9780898717013

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 992

EP - 1004

BT - Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms

PB - Association for Computing Machinery (ACM)

T2 - 21st Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 17 January 2010 through 19 January 2010

ER -