A local lemma via entropy compression
From MaRDI portal
Publication:6265490
Abstract: In the framework of the probabilistic method in combinatorics, we revisit the entropy compression method clarifying the setting in which it can be applied and providing a theorem yielding a general constructive criterion. We finally elucidate, through topical examples, the effectiveness of the entropy-compression criterion in comparison with the Lovasz Local Lemma criterion and, in particular, with the improved criterion based on cluster expansion.
This page was built for publication: A local lemma via entropy compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6265490)
