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

Clinical Orthopaedics and Related Research, Volume 43, Issue 2, 2014, Pages 718-729.

Cited by: 84|Bibtex|Views7|Links
EI
Keywords:
fastest known algorithmppsz stepppsz algorithmunique-sat boundssatisfiable cnf formulaMore(18+)

Abstract:

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...More

Code:

Data:

Your rating :
0

 

Tags
Comments