Abstract
In this survey, we study recent developments on the CNF satisfiability problem. The first one is about deterministic (and of course exponential-time) algorithms for k-SAT. The most recent improvement for k = 3 and 4 is based on the nontrivial combination of the Schöning’s local search algorithm and the backtrack-type algorithm by Paturi, Pudlák, Saks, and Zane. This approach is due to Iwama and Tamaki and the current fastest algorithm, based on the same method, is due to Rolf, which runs in time O(1.32216n).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwama, K. (2008). SAT, UNSAT and Coloring. In: Kleine Büning, H., Zhao, X. (eds) Theory and Applications of Satisfiability Testing – SAT 2008. SAT 2008. Lecture Notes in Computer Science, vol 4996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79719-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-79719-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79718-0
Online ISBN: 978-3-540-79719-7
eBook Packages: Computer ScienceComputer Science (R0)