Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel

The Lovász local lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection ℬ$$ \mathcal{B} $$ of “bad” events which are mostly independent and have low probability. A seminal algorithm of Moser and Tardos (J. ACM, 2010, 57, 11) (...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 63; no. 3; pp. 716 - 752
Main Author:	Harris, David G.
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.10.2023 Wiley Subscription Services, Inc
Subjects:	Algorithms Coloring derandomization independent transversal LLL Lovász Local Lemma Probability theory strong coloring
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!