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.
Research supported by DFG grant TH 472/4-1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N.: A parallel algorithmic version of the Local Lemma. Random Structures and Algorithms 2(4), 367–378 (1991)
Alon, N., Spencer, J., Erdős, P.: The probabilistic method. Wiley, Chichester (1992)
Beck, J.: An algorithmic approach to the Lovász Local Lemma. Random Structures and Algorithms 2(4), 343–366 (1991)
Erdős, P., Lovász, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Hajnal, A., Sós, V. (eds.) Infinite and Finite Sets, pp. 609–627. North-Holland, Amsterdam (1975)
Erdős, P., Spencer, J.: Lopsided Lovász Local Lemma and latin transversals. Discrete Applied Mathematics 30, 151–154 (1991)
Fortnow, L.: A Kolmogorov complexity proof of the Lovász Local Lemma. Computational Complexity Blog (2009), http://blog.computationalcomplexity.org/2009/06/kolmogorov-complexity-proof-of-lov.html
Gebauer, H.: Disproof of the neighborhood conjecture with implications to SAT. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 764–775. Springer, Heidelberg (2009)
Graham, R., Knuth, D., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994)
Gebauer, H., Moser, R., Scheder, D., Welzl, E.: The Lovász Local Lemma and satisfiability. In: Albers, S., Alt, H., Näher, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 30–54. Springer, Heidelberg (2009)
Gebauer, H., Szabó, T., Tardos, G.: The Local Lemma is tight for SAT. In: 22nd ACM-SIAM Symp. on Discrete Algorithms, pp. 664–674 (2011)
Li, M., Vitányi, P.: An introduction to Kolmogorov complexity and its applications, 3rd edn. Springer, Heidelberg (2008)
McDiarmid, C.: Hypergraph coloring and the Lovász Local Lemma. Discrete Mathematics 167/168, 481–486 (1997)
Moser, R.A.: Derandomizing the Lovász Local Lemma more efficiently. Technical report (2008), http://arxiv.org/abs/0807.2120
Moser, R.A.: A constructive proof of the Lovász Local Lemma. In: 41th Symposium on Theory on Computing (STOC), pp. 343–350 (2009)
Moser, R., Tardos, G.: A constructive proof of the general Lovász Local Lemma. Journal of the ACM 57(2), 11:1–11:15 (2010)
Schöning, U.: Algorithmik. Spektrum Akademischer Verlag, Heidelberg (2001)
Spencer, J.: Robin Moser makes Lovász Local Lemma algorithmic! (2010), http://cs.nyu.edu/spencer/moserlovasz1.pdf
Srinivasan, A.: Improved algorithmic versions of the Lovász Local Lemma. In: 9th ACM-SIAM Symp. on Discrete Algorithms, pp. 611–620 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Messner, J., Thierauf, T. (2011). A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)