A constructive proof of the general Lovasz Local Lemma

A constructive proof of the general Lovasz Local Lemma

The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive variant can be given under certain more restrictive conditions. Si...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Moser, Robin A, Tardos, Gábor
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Computational Complexity
Computer Science - Data Structures and Algorithms
Computer Science - Discrete Mathematics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Moser, Robin A
Tardos, Gábor
description The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive variant can be given under certain more restrictive conditions. Simplifications of his procedure and relaxations of its restrictions were subsequently exhibited in several publications [Alo91, MR98, CS00, Mos06, Sri08, Mos08]. In [Mos09], a constructive proof was presented that works under negligible restrictions, formulated in terms of the Bounded Occurrence Satisfiability problem. In the present paper, we reformulate and improve upon these findings so as to directly apply to almost all known applications of the general Local Lemma.
doi_str_mv 10.48550/arxiv.0903.0544
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_0903_0544</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>0903_0544</sourcerecordid><originalsourceid>FETCH-LOGICAL-a654-96b48e640a38d20e8abf519a21c007136063af3dc75c6ff165f317e55359042a3</originalsourceid><addsrcrecordid>eNotjkFrwkAQRvfioWjvPcn-gaSzmZ1NchSpWgj04j2M62wbMEY2aaj--hpb-ODxXR5PqRcDqS2I4JXjTzOmUAKmQNY-KbfSvjv3Q_z2QzOKvsSuC_q-4Uv0p5wl8klX3cj97Q4_HWlbXqhZ4FMvz_-cq_3mbb_eJdXH9n29qhJ2ZJPSHWwhzgJjccxACj4EMiVnxgPkBh045IBHn5N3IRhHAU0uREgl2IxxrpZ_2kd3fYlNy_FaT_311I-_F18-XQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A constructive proof of the general Lovasz Local Lemma</title><source>arXiv.org</source><creator>Moser, Robin A ; Tardos, Gábor</creator><creatorcontrib>Moser, Robin A ; Tardos, Gábor</creatorcontrib><description>The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive variant can be given under certain more restrictive conditions. Simplifications of his procedure and relaxations of its restrictions were subsequently exhibited in several publications [Alo91, MR98, CS00, Mos06, Sri08, Mos08]. In [Mos09], a constructive proof was presented that works under negligible restrictions, formulated in terms of the Bounded Occurrence Satisfiability problem. In the present paper, we reformulate and improve upon these findings so as to directly apply to almost all known applications of the general Local Lemma.</description><identifier>DOI: 10.48550/arxiv.0903.0544</identifier><language>eng</language><subject>Computer Science - Computational Complexity ; Computer Science - Data Structures and Algorithms ; Computer Science - Discrete Mathematics</subject><creationdate>2009-03</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/0903.0544$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.0903.0544$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Moser, Robin A</creatorcontrib><creatorcontrib>Tardos, Gábor</creatorcontrib><title>A constructive proof of the general Lovasz Local Lemma</title><description>The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive variant can be given under certain more restrictive conditions. Simplifications of his procedure and relaxations of its restrictions were subsequently exhibited in several publications [Alo91, MR98, CS00, Mos06, Sri08, Mos08]. In [Mos09], a constructive proof was presented that works under negligible restrictions, formulated in terms of the Bounded Occurrence Satisfiability problem. In the present paper, we reformulate and improve upon these findings so as to directly apply to almost all known applications of the general Local Lemma.</description><subject>Computer Science - Computational Complexity</subject><subject>Computer Science - Data Structures and Algorithms</subject><subject>Computer Science - Discrete Mathematics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjkFrwkAQRvfioWjvPcn-gaSzmZ1NchSpWgj04j2M62wbMEY2aaj--hpb-ODxXR5PqRcDqS2I4JXjTzOmUAKmQNY-KbfSvjv3Q_z2QzOKvsSuC_q-4Uv0p5wl8klX3cj97Q4_HWlbXqhZ4FMvz_-cq_3mbb_eJdXH9n29qhJ2ZJPSHWwhzgJjccxACj4EMiVnxgPkBh045IBHn5N3IRhHAU0uREgl2IxxrpZ_2kd3fYlNy_FaT_311I-_F18-XQ</recordid><startdate>20090303</startdate><enddate>20090303</enddate><creator>Moser, Robin A</creator><creator>Tardos, Gábor</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20090303</creationdate><title>A constructive proof of the general Lovasz Local Lemma</title><author>Moser, Robin A ; Tardos, Gábor</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a654-96b48e640a38d20e8abf519a21c007136063af3dc75c6ff165f317e55359042a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Computer Science - Computational Complexity</topic><topic>Computer Science - Data Structures and Algorithms</topic><topic>Computer Science - Discrete Mathematics</topic><toplevel>online_resources</toplevel><creatorcontrib>Moser, Robin A</creatorcontrib><creatorcontrib>Tardos, Gábor</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Moser, Robin A</au><au>Tardos, Gábor</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A constructive proof of the general Lovasz Local Lemma</atitle><date>2009-03-03</date><risdate>2009</risdate><abstract>The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive variant can be given under certain more restrictive conditions. Simplifications of his procedure and relaxations of its restrictions were subsequently exhibited in several publications [Alo91, MR98, CS00, Mos06, Sri08, Mos08]. In [Mos09], a constructive proof was presented that works under negligible restrictions, formulated in terms of the Bounded Occurrence Satisfiability problem. In the present paper, we reformulate and improve upon these findings so as to directly apply to almost all known applications of the general Local Lemma.</abstract><doi>10.48550/arxiv.0903.0544</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.0903.0544
ispartof
issn
language eng
recordid cdi_arxiv_primary_0903_0544
source arXiv.org
subjects Computer Science - Computational Complexity
Computer Science - Data Structures and Algorithms
Computer Science - Discrete Mathematics
title A constructive proof of the general Lovasz Local Lemma
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T11%3A50%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20constructive%20proof%20of%20the%20general%20Lovasz%20Local%20Lemma&rft.au=Moser,%20Robin%20A&rft.date=2009-03-03&rft_id=info:doi/10.48550/arxiv.0903.0544&rft_dat=%3Carxiv_GOX%3E0903_0544%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true