3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General

Details 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General

2011-03-10

arxiv.org/abs/1103.2165v2

Computer Science

Computational Complexity

12 pages, no figures; critical variables are now called frozen, added reference to Makino et al., shortened some proofs and fi

Scientific paper

The PPSZ algorithm by Paturi, Pudl\'ak, Saks, and Zane [1998] is the fastest known algorithm for Unique k-SAT, where the input formula does not have more than one satisfying assignment. For k>=5 the same bounds hold for general k-SAT. We show that this is also the case for k=3,4, using a slightly modified PPSZ algorithm. We do the analysis by defining a cost for satisfiable CNF formulas, which we prove to decrease in each PPSZ step by a certain amount. This improves our previous best bounds with Moser and Scheder [2011] for 3-SAT to O(1.308^n) and for 4-SAT to O(1.469^n).

Affiliated with

Also associated with

No associations

Rating

3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General 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 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-429604