Abstract
In Chap. 2, we discuss a branching algorithm for the k-Satisfiability problem. In this chapter we consider more techniques for solving k-SAT. Both techniques are based on performing local search in balls in the Hamming space around some assignments. The first algorithm randomly chooses an assignment and performs a random walk of short length (in Hamming distance) to search for the solution. The second algorithm is deterministic and uses a similar idea; but instead of using a random walk, it finds a covering of the Hamming space by balls of specified radius and performs a search inside these balls.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 1999), pp. 410–414. IEEE (1999)
Schöning, U.: A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica 32(4), 615–623 (2002)
Papadimitriou, C.H.: On selecting a satisfying truth assignment (extended abstract). In: Proceedings of the 32nd annual Symposium on Foundations of Computer Science (FOCS 1991), pp. 163–169. IEEE (1991).
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York, NY, USA (2005)
Feller, W.: An introduction to probability theory and its applications. Vol. I, third edn. John Wiley & Sons Inc., New York (1968)
Paturi, R., Pudlák, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-SAT. J. ACM 52(3), 337–364 (2005).
Paturi, R., Pudlák, P., Zane, F.: Satisfiability coding lemma. Chicago J. Theor. Comput. Sci. 1999, Article 11 (1999).
Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), p. 328. SIAM (2004)
Hofmeister, T., Schöning, U., Schuler, R., Watanabe, O.: Randomized algorithms for 3-SAT. Theory Comput. Syst. 40(3), 249–262 (2007).
Rolf, D.: Improved bound for the PPSZ/Schöning-algorithm for 3-SAT. J. Satisfiability, Boolean Modeling and Computation 1(2), 111–122 (2006)
Schöning, U.: Algorithmics in exponential time. In: Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS 2005), Lecture Notes in Comput. Sci., vol. 3404, pp. 36–43. Springer (2005)
Iwama, K.: Worst-case upper bounds for k-SAT. Bulletin of the EATCS 82, 61–71 (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. Theor. Comp. Sci. 289(1), 69–83 (2002)
Hochbaum, D.S. (ed.): Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, MA, USA (1997)
Brueggemann, T., Kern, W.: An improved deterministic local search algorithm for 3-SAT. Theor. Comp. Sci. 329(1-3), 303–313 (2004)
Scheder, D.: Guided search and a faster deterministic algorithm for 3-SAT. In: Proceedings of the 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), Lecture Notes in Comput. Sci., vol. 4957, pp. 60–71. Springer (2008)
Dantsin, E., Hirsch, E.A.:Worst-case upper bounds. In: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, chap. 12, pp. 403–424. IOS Press (2009)
Feder T., Motwani, R.: Worst-case time bounds for coloring and satisfiability problems. J. Algorithms 45(2), 192-201 (2002).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fomin, F.V., Kratsch, D. (2010). Local Search and SAT. In: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16533-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-16533-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16532-0
Online ISBN: 978-3-642-16533-7
eBook Packages: Computer ScienceComputer Science (R0)