• DOI:10.1109/FOCS.2011.22
Corpus ID: 2152587

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

@article{Hertli20113SATFA,
  title={3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General},
  author={Timon Hertli},
  journal={2011 IEEE 52nd Annual Symposium on Foundations of Computer Science},
  year={2011},
  pages={277-284}
}

Timon Hertli

Published 2011

Mathematics, Computer Science

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science

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… CONTINUE READING

View on IEEE

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed