Abstract
Recently, several algorithms for the NP-complete problem k-SAT have been proposed and rigorously analyzed. These algorithms are based on the heuristic principle of local search. Their deterministic and their probabilistic versions and variations, have been shown to achieve the best complexity bounds that are known for k-SAT (or the special case 3-SAT). We review these algorithms, their underlying principles and their analyses.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
B. Aspvall, M. F. Plass, R. E. Tarjan: A linear time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters 8(3) (1979) 121–123.
R. B. Ash: Information Theory. Dover 1965.
G. Cohen, I. Honkala, S. Litsyn, A. Lobstein: Covering Codes. North-Holland 1997.
E. Dantsin, A. Goerdt, E. A. Hirsch, U. Schöning: Deterministic algorithms for k-SAT based on covering codes and local search. Proc. 27th International Colloquium on Automata, Languages and Programming 2000. Springer Lecture Notes in Computer Science, Vol. 1853, pages 236–247, 2000.
E. Dantsin, A. Goerdt, E. A. Hirsch, R. Kannan, J. Kleinberg, C. Papadimitriou, P. Raghavan, U. Schöning: A deterministic \( (2 - \tfrac{2} {{k + 1}})^n \) algorithm for k-SAT based on local search. To appear in Theoretical Computer Science.
G. R. Grimmett, D. R. Stirzaker: Probability and Random Processes. Oxford University Press, 2nd Edition, 1992.
D. S. Hochbaum (ed.): Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1997.
T. Hofmeister, U. Schöning, R. Schuler, O. Watanabe: A probabilistic 3-SAT algorithm further improved. submitted.
O. Kullmann: New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science 223 (1999) 1–72.
B. Monien, E. Speckenmeyer: Solving satisfiability in less than 2n steps. Discrete Applied Mathematics 10 (1985) 287–295.
C. H. Papadimitriou: On selecting a satisfying truth assignment. Proceedings of the 32nd Ann. IEEE Symp. on Foundations of Computer Science, 163–169, 1991.
R. Paturi, P. Pudlák, F. Zane: Satisfiability coding lemma. Proceedings 38th IEEE Symposium on Foundations of Computer Science 1997, 566–574.
R. Paturi, P. Pudlák, M. E. Saks, F. Zane: An improved exponential-time algorithm for k-SAT. Proceedings 39th IEEE Symposium on Foundations of Computer Science 1998, 628–637.
U. Schöning: On The Complexity Of Constraint Satisfaction Problems. Ulmer Informatik-Berichte, Nr. 99-03. Universität Ulm, Fakultät für Informatik, 1999.
U. Schöning: A probabilistic algorithm for k-SAT and constraint satisfaction problems. Proceedings 40th IEEE Symposium on Foundations of Computer Science 1999, 410–414.
U. Schöning: A probabilistic algorithm for k-SAT based on limited local search and restart. To appear in Algorithmica.
R. Schuler, U. Schöning, O. Watanabe: An Improved Randomized Algorithm For 3-SAT. Techn. Report TR-C146, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schöning, U. (2001). New Algorithms for k-SAT Based on the Local Search Principle. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_9
Download citation
DOI: https://doi.org/10.1007/3-540-44683-4_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42496-3
Online ISBN: 978-3-540-44683-5
eBook Packages: Springer Book Archive