A constructive proof of the general Lovasz Local Lemma

Details A constructive proof of the general Lovasz Local Lemma A constructive proof of the general Lovasz Local Lemma

2009-03-03

arxiv.org/abs/0903.0544v3

Computer Science

Data Structures and Algorithms

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A constructive proof of the general Lovasz Local Lemma does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A constructive proof of the general Lovasz Local Lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A constructive proof of the general Lovasz Local Lemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653201