Abstract
Exponential algorithms, i.e. algorithms of complexity O(c n) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem in question needs to be solved exactly and not approximately. If the constant c is close to 1 such algorithms have practical importance. Deterministic algorithms of exponential complexity usually involve some kind of backtracking. The analysis of such backtracking algorithms in terms of solving recurrence equations is quite well understood. The purpose of the current paper is to show cases in which the constant c could be significantly reduced, and to point out that there are some randomized exponential-time algorithms which use randomization in some new ways. Most of our examples refer to the 3-SAT problem, i.e. the problem of determining satisfiability of formulas in conjunctive normal form with at most 3 literals per clause.
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. Information Processing Letters 8(3), 121–123 (1979)
Ash, R.B.: Information Theory. Dover, New York (1965)
Baumer, S., Schuler, R.: Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 150–161. Springer, Heidelberg (2004)
Beigel, R., Eppstein, D.: 3-coloring in time O(1:3446 n ): a no-MIS algorithm. In: Proceedings of the 36nd Annual IEEE Symposium on Foundations of Computer Science, pp. 444–452. IEEE, Los Alamitos (1995)
Brueggemann, T., Kern, W.: An improved local search algorithm for 3-SAT. Memorandum No. 1709, Department of Applied Mathematics, University of Twente (2004)
Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. North-Holland, Amsterdam (1997)
Dantsin, E., Goerdt, A., Hirsch, E.A., Schöning, U.: Deterministic algorithms for k-SAT based on covering codes and local search. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 236–247. Springer, Heidelberg (2000)
Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Schöning, U.: A deterministic \((2-\frac{2}{k+1})^{n}\) algorithm for k-SAT based on local search. To appear in Theoretical Computer Science
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. 193–202. Springer, Heidelberg (2002)
Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. Electronic Colloquium on Computational Complexity. Report No. 53 (2003); Also in: Proceedings of the fifteenth annual ACM-SIAM Symposium on Discrete algorithms, p. 328. ACM, New York (2004)
Monien, B., Speckenmeyer, E.: Solving satisfiability in less than 2n steps. Discrete Applied Mathematics 10, 287–295 (1985)
Papadimitriou, C.H.: On selecting a satisfying truth assignment. In: Proceedings of the 32nd Ann. IEEE Symp. on Foundations of Computer Science, pp. 163–169 (1991)
Paturi, R., Pudlák, P., Zane, F.: Satisfiability coding lemma. In: Proceedings 38th IEEE Symposium on Foundations of Computer Science 1997, pp. 566–574 (1997)
Paturi, R., Pudlák, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-SAT. In: Proceedings 39th IEEE Symposium on Foundations of Computer Science 1998, pp. 628–637 (1998)
Saks, M., Wigderson, A.: Probabilistic boolean decision trees and the complexity of evaluating game trees. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pp. 29–38. IEEE Computer Science Press, Los Alamitos (1986)
Schöning, U.: On The Complexity of Constraint Satisfaction Problems. Ulmer Informatik-Berichte, Nr. 99-03. Universität Ulm, Fakultät für Informatik (1999)
Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings 40th IEEE Symposium on Foundations of Computer Science 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)
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
Schöning, U. (2005). Algorithmics in Exponential Time. In: Diekert, V., Durand, B. (eds) STACS 2005. STACS 2005. Lecture Notes in Computer Science, vol 3404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31856-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-31856-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24998-6
Online ISBN: 978-3-540-31856-9
eBook Packages: Computer ScienceComputer Science (R0)