Abstract
The satisfiability problem of Boolean Formulae in 3-CNF (3-SAT) is a well known NP-complete problem and the development of faster (moderately exponential time) algorithms has received much interest in recent years. We show that the 3-SAT problem can be solved by a probabilistic algorithm in expected time O(1,3290n). Our approach is based on Schöning’s random walk algorithm for k-SAT, modified in two ways.
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
Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. IPL 8(3), 121–123 (1979)
Aida, S., Schuler, R., Tatsukiji, T., Watanabe, O.: The difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. Theory of Computing Systems 35, 449–463 (2002)
Dantsin, E., Goerdt, A., Hirsch, E., 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, 69–83 (2002)
Hofmeister, T., Schöning, U., Schuler, R., Watanabe, O.: A probabilistic 3-SAT algorithm further improved. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 192–203. Springer, Heidelberg (2002)
Kullmann, O.: New methods for 3-sat decision and worst-case analysis. Theoretical Computer Science 223, 1–72 (1999)
Monien, B., Speckenmeyer, E.: Solving satisfiability in less than 2n steps. Discrete Applied Mathematics 10, 287–295 (1985)
Paturi, R., Pudlák, P., Zane, F.: Satisfiability coding lemma. In: 38th Ann. IEEE Sympos. on Foundations of Comp. Sci. (FOCS 1997), pp. 566–574 (1997)
Paturi, R., Pudlák, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-sat. In: 39th Ann. IEEE Sympos. on Foundations of Comp. Sci. (FOCS 1998), pp. 410–414 (1998)
Schiermeyer, I.: Solving 3-satisfiability in less than o(1, 579n) steps. In: Martini, S., Börger, E., Kleine Büning, H., Jäger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol. 702, pp. 379–394. Springer, Heidelberg (1993)
Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proc. 40th FOCS, pp. 410–414. ACM, New York (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baumer, S., Schuler, R. (2004). Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. In: Giunchiglia, E., Tacchella, A. (eds) Theory and Applications of Satisfiability Testing. SAT 2003. Lecture Notes in Computer Science, vol 2919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24605-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-24605-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20851-8
Online ISBN: 978-3-540-24605-3
eBook Packages: Springer Book Archive