A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability

DOI10.1007/978-3-642-22685-4_15zbMath1353.68146OpenAlexW151625577MaRDI QIDQ3087948

Jochen Messner, Thomas Thierauf

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_15

Mathematics Subject Classification ID

Combinatorial probability (60C05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

This page was built for publication: A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability