Abstract
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1 − 1/α) up to a polynomial factor, where α = ln (m/n) + O(ln ln m) and n, m are respectively the number of variables and the number of clauses in the input formula. This bound is asymptotically better than the previously best known 2n(1 − 1/log(2m)) bound for SAT.
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
Brueggemann, T., Kern, W.: An improved local search algorithm for 3-SAT. Theoretical Computer Science 329(1-3), 303–313 (2004)
Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Schöning, U.: A deterministic (2 − 2/(k + 1))n algorithm for k-SAT based on local search. Theoretical Computer Science 289(1), 69–83 (2002)
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 algorithm for SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 69–75. Springer, Heidelberg (2005)
Dantsin, E., Wolpert, A.: An improved upper bound for SAT. Electronic Colloquium on Computational Complexity, Report TR05-030 (March 2005)
Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, January 2004, p. 328 (2004); A preliminary version appeared in Electronic Colloquium on Computational Complexity, Report No. 53 (July 2003)
Paturi, R., Pudlák, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-SAT. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1998, pp. 628–637 (1998)
Paturi, R., Pudlák, P., Zane, F.: Satisfiability coding lemma. In: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1997, pp. 566–574 (1997)
Pudlák, P.: Satisfiability – algorithms and logic. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 129–141. Springer, Heidelberg (1998)
Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1999, pp. 410–414 (1999)
Schöning, U.: A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica 32(4), 615–623 (2002)
Schuler, R.: An algorithm for the satisfiability problem of formulas in conjunctive normal form. Journal of Algorithms 54(1), 40–44 (2005); A preliminary version appeared as a technical report in 2003
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
Dantsin, E., Wolpert, A. (2005). An Improved Upper Bound for SAT. In: Bacchus, F., Walsh, T. (eds) Theory and Applications of Satisfiability Testing. SAT 2005. Lecture Notes in Computer Science, vol 3569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499107_31
Download citation
DOI: https://doi.org/10.1007/11499107_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26276-3
Online ISBN: 978-3-540-31679-4
eBook Packages: Computer ScienceComputer Science (R0)