DETERMINISTIC ALGORITHMS FOR THE LOVASZ LOCAL LEMMA

The Lovasz local lemma (LLL) [P. Erdos and L. Lovasz, 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. Sos, eds., North-Holland, Amsterdam, 1975, pp. 609-627] is a powerful result in probability theory that informally states the following: the probability that none of a set of bad events happens is positive if the probability of each event is small compared to the number of events that depend on it. The LLL is often used for nonconstructive existence proofs of combinatorial structures. A prominent application is to k-CNF formulas, where the LLL implies that if every clause in a formula shares variables with at most d <= 2(k)/(sic) - 1 other clauses, then such a formula has a satisfying assignment. Recently, a randomized algorithm to efficiently construct a satisfying assignment in this setting was given by Moser [A constructive proof of the Lovasz local lemma, in STOC '09: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, ACM, New York, 2009, pp. 343-350]. Subsequently Moser and Tardos [J. ACM, 57 (2010), pp. 11:1-11:15] gave a general algorithmic framework for the LLL and a randomized algorithm within this framework to construct the structures guaranteed by the LLL. The main problem left open by Moser and Tardos was to design an efficient deterministic algorithm for constructing structures guaranteed by the LLL. In this paper we provide such an algorithm. Our algorithm works in the general framework of Moser and Tardos with a minimal loss in parameters. For the special case of constructing satisfying assignments for k-CNF formulas with m clauses, where each clause shares variables with at most d <= 2(k/(1+c))/e - 1 other clauses, for any epsilon is an element of (0, 1), we give a deterministic algorithm that finds a satisfying assignment in time (O) over tilde (m(2(1+1/epsilon))). This improves upon the deterministic algorithms of Moser and of Moser and Tardos with running times m(Omega(k2)) and m(Omega(d log d)), respectively, which are superpolynomial for k = omega(1) and d = omega(1), and upon the previous best deterministic algorithm of Beck, which runs in polynomial time only for d <= 2(k/16)/4. Our algorithm is the first deterministic algorithm that works in the general framework of Moser and Tardos. We also give a parallel NC algorithm for the same setting, improving upon an algorithm of Alon [Random Structures Algorithms, 2 (1991), pp. 367-378].