Combinatorica
Lopsided Lova´sz Local Lemma and Latin transversals
ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
Hypergraph colouring and the Lovász local lemma
Discrete Mathematics
Improved algorithmic versions of the Lovász Local Lemma
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An Introduction to Kolmogorov Complexity and Its Applications
An Introduction to Kolmogorov Complexity and Its Applications
A constructive proof of the Lovász local lemma
Proceedings of the forty-first annual ACM symposium on Theory of computing
A constructive proof of the general lovász local lemma
Journal of the ACM (JACM)
An algorithmic approach to the lovász local lemma. I
Random Structures & Algorithms
A parallel algorithmic version of the local lemma
Random Structures & Algorithms
The local lemma is tight for SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 5.23 |
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.