Abstract
In this paper we describe and analyse an improved algorithm for solving the 3-Satisfiability problem. If F is a boolean formula in conjunctive normal form with n variables and r clauses, then we will show that this algorithm solves the Satisfiability problem for formulas with at most three literals per clause in time less than O(1,579n).
Preview
Unable to display preview. Download preview PDF.
References
S. A. Cook, the Complexity of Theorem-Proving Procedures, Proc. 3rd Ann. ACM Symp. on Theory of Computing, New York, 1971, 151–158.
M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.
B. Monien and E. Speckenmeyer, Solving Satisfiability in less than 2 n Steps, Discrete Appl. Math. 10 (1985) 287–295.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schiermeyer, I. (1993). Solving 3-satisfiability in less than 1, 579n steps. In: Börger, E., Jäger, G., Kleine Büning, H., Martini, S., Richter, M.M. (eds) Computer Science Logic. CSL 1992. Lecture Notes in Computer Science, vol 702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56992-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-56992-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56992-3
Online ISBN: 978-3-540-47890-4
eBook Packages: Springer Book Archive