A constructive proof of the general lovász local lemma

Robin A. Moser, Gábor Tardos

Research output: Contribution to journalArticle

219 Citations (Scopus)

Abstract

The Lovász Local Lemma discovered by Erds and Lovász in 1975 is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In 1991, József Beck was the first to demonstrate that a constructive variant can be given under certain more restrictive conditions, starting a whole line of research aimed at improving his algorithm's performance and relaxing its restrictions. In the present article, we improve upon recent findings so as to provide a method for making almost all known applications of the general Local Lemma algorithmic.

Original languageEnglish
Article number11
JournalJournal of the ACM
Volume57
Issue number2
DOIs
Publication statusPublished - Jan 1 2010

Keywords

  • Constructive proof
  • Lovász local lemma
  • Parallelization

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Information Systems
  • Hardware and Architecture
  • Artificial Intelligence

Cite this