This is a preview of subscription content, log in via an institution to check access.
Recommended Reading
Baumer S, Schuler R (2003) Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs. In: SAT, Santa Margherita Ligure, pp 150–161
Calabro C, Impagliazzo R, Kabanets V, Paturi R (2003) The complexity of unique k-SAT: an isolation lemma for k-CNFs. In: Proceedings of the eighteenth IEEE conference on computational complexity, Aarhus
Dantsin E, Goerdt A, Hirsch EA, Kannan R, Kleinberg J, Papadimitriou C, Raghavan P, Schöning U (2002) A deterministic \((2 - \frac{2} {k+1})^{n}\) algorithm for k-SAT based on local search. Theor Comp Sci 289(1):69–83
Davis M, Logemann G, Loveland D (1962) A machine program for theorem proving. Commun ACM 5:394–397
Hofmeister T, Schöning U, Schuler R, Watanabe O (2002) A probabilistic 3-SAT algorithm further improved. In: STACS, Antibes Juan-les-Pins. LNCS, vol 2285, Springer, Berlin, pp 192–202
Iwama K, Tamaki S (2004) Improved upper bounds for 3-SAT. In: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, New Orleans, pp 328–329
Kullmann O (1999) New methods for 3-SAT decision and worst-case analysis. Theor Comp Sci 223(1–2):1–72
Monien B, Speckenmeyer E (1985) Solving satisfiability in less than 2 n steps. Discret Appl Math 10:287–295
Paturi R, Pudlák P, Saks M, Zane F (2005) An improved exponential-time algorithm for k-SAT. J ACM 52(3):337–364. (An earlier version presented in Proceedings of the 39th annual IEEE symposium on foundations of computer science, 1998, pp 628–637)
Paturi R, Pudlák P, Zane F (1999) Satisfiability Coding Lemma. In: Proceedings of the 38th annual IEEE symposium on foundations of computer science, Miami Beach, 1997, pp. 566–574. Chicago J Theor Comput Sci. http://cjtcs.cs.uchicago.edu/
Rolf D (2003) 3-SAT ∈ RTIME (1. 32971n). In: ECCC TR03-054
Schöning U (2002) A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica 32:615–623. (An earlier version appeared in 40th annual symposium on foundations of computer science (FOCS ’99), pp 410–414)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this entry
Cite this entry
Paturi, R., Pudlák, P., Saks, M., Zane, F. (2015). Backtracking Based k-SAT Algorithms. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_45-2
Download citation
DOI: https://doi.org/10.1007/978-3-642-27848-8_45-2
Received:
Accepted:
Published:
Publisher Name: Springer, Boston, MA
Online ISBN: 978-3-642-27848-8
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering