A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability

The Lovasz Local Lemma provides a syntactic property that a Boolean formula is satisifiable. Moser and Tardos came up with a constructive proof of the lemma, i.e. the proof gives a method to actually construct a satisfying assignment. In this paper, we give another constructive proof of the lemma, based on Kolmogorov complexity. Actually, we even improve their result slightly.

[1]  Joel H. Spencer,et al.  Asymptotic lower bounds for Ramsey functions , 1977, Discret. Math..

[2]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[3]  Noga Alon,et al.  A parallel algorithmic version of the local lemma , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  Jochen Messner,et al.  A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability , 2011, COCOON.

[5]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7]  James B. Shearer,et al.  On a problem of spencer , 1985, Comb..

[8]  Emo Welzl,et al.  The Lovász Local Lemma and Satisfiability , 2009, Efficient Algorithms.

[9]  Colin McDiarmid,et al.  Hypergraph colouring and the Lovász Local Lemma , 1997, Discret. Math..

[10]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

[11]  Gábor Tardos,et al.  The local lemma is tight for SAT , 2010, SODA '11.

[12]  Robin A. Moser.  Derandomizing the Lovasz Local Lemma more effectively , 2008, ArXiv.

[13]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science (2. ed.) , 1994 .

[14]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[15]  Paul Erdös,et al.  Lopsided Lovász Local Lemma and Latin transversals , 1991, Discret. Appl. Math..

[16]  Heidi Gebauer.  Disproof of the Neighborhood Conjecture with Implications to SAT , 2009, ESA.

[17]  Gábor Tardos,et al.  A constructive proof of the general lovász local lemma , 2009, JACM.

[18]  Aravind Srinivasan.  Improved algorithmic versions of the Lovász Local Lemma , 2008, SODA '08.

[19]  Robin A. Moser.  A constructive proof of the Lovász local lemma , 2008, STOC '09.

[20]  Cristian S. Calude.  Information and Randomness , 1994, Monographs in Theoretical Computer Science An EATCS Series.