Abstract
We improve an upper bound by Hirsch on a deterministic algorithm for solving general CNF satisfiability problem. With more detail analysis of Hirsch’s algorithm, we give some improvements, by which we can prove an upper bound \(\tilde{\mathcal{O}}(1.234^{m})\) w.r.t. the number m of input clauses, which improves Hirsch’s bound \(\tilde{\mathcal{O}}(1.239^{m})\).
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
Preview
Unable to display preview. Download preview PDF.
References
Dantsin, E., Hirsch, E.A., Wolpert, A.: Algorithms for SAT based on search in Hamming balls. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 141–151. Springer, Heidelberg (2004)
Dantsin, E., Wolpert, A.: Derandomization of Schuler’s algorithms for SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 69–75. Springer, Heidelberg (2005)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Comm. ACM (5), 394–397 (1962)
Davis, M., Putnam, H.: A computing procedure for quantification theory. J. of ACM (7), 201–215 (1960)
Hirsch, E.A.: New Worst-Case Upper Bounds for SAT. J. of Automated Reasoning 24, 397–420 (2000) (It is also in Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 521–530 (1998))
Monien, B., Speckenmeyer, E.: Solving satisfiability in less than 2n steps. Discrete Appl. Math. (10), 287–295 (1985)
Pudlák, P.: Satisfiability - algorithm and logic. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 129–141. Springer, Heidelberg (1998)
Schuler, R.: An algorithm for the satisfiability problem of formulas in conjunctive normal form. J. of Algorithms 54, 40–44 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamoto, M. (2005). An Improved \(\tilde{\mathcal{O}}(1.234^{m})\)-Time Deterministic Algorithm for SAT. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_65
Download citation
DOI: https://doi.org/10.1007/11602613_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)