Extensions of the Algorithmic Lovasz Local Lemma

14 Aug 2020 Kolmogorov Vladimir

We consider recent formulations of the algorithmic Lovasz Local Lemma by Achlioptas-Iliopoulos-Kolmogorov [2] and by Achlioptas-Iliopoulos-Sinclair [3]. These papers analyze a random walk algorithm for finding objects that avoid undesired "bad events" (or "flaws"), and prove that under certain conditions the algorithm is guaranteed to find a "flawless" object quickly... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • PROBABILITY