An extension of the Moser-Tardos algorithmic local lemma

Details An extension of the Moser-Tardos algorithmic local lemma An extension of the Moser-Tardos algorithmic local lemma

2011-02-14

arxiv.org/abs/1102.2853v2

Mathematics

Combinatorics

8 pages

Scientific paper

A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics extends the Lov\'asz Local Lemma by weakening the conditions under which its conclusions holds. In this note, we prove an algorithmic analog of this result, extending Moser and Tardos's recent algorithmic Local Lemma, and providing an alternative proof of the theorem of Bissacot, et al. applicable in the Moser-Tardos algorithmic framework.

Affiliated with

Also associated with

No associations

Rating

An extension of the Moser-Tardos algorithmic 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 An extension of the Moser-Tardos algorithmic local lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An extension of the Moser-Tardos algorithmic local lemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216814