A kolmogorov complexity proof of the lovász local lemma for satisfiability

Authors:
Jochen Messner;Thomas Thierauf
Affiliations:
Aalen University, Aalen, Germany;Aalen University, Aalen, Germany
Venue:
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Year:
2011

Citing 10
Cited 0

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
The Lovász Local Lemma and Satisfiability

Efficient Algorithms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Moser and Tardos [MT10] came up with a constructive proof of the Lovász Local Lemma. In this paper, we give another constructive proof of the lemma, based on Kolmogorov complexity. Actually, we even improve the Local Lemma slightly.