Exact algorithms and complexity

0Citations
Citations of this article
331Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Over the past couple of decades, a series of exact exponential-time algorithms have been developed with improved run times for a number of problems including IndependentSet, k-SAT, and k-colorability using a variety of algorithmic techniques such as backtracking, dynamic programming, and inclusion-exclusion. The series of improvements are typically in the form of better exponents compared to exhaustive search. These improvements prompt several questions, chief among them is whether we can expect continued improvements in the exponent. Is there a limit beyond which one should not expect improvement? If we assume NP ≠ P or other appropriate complexity statement, what can we say about the likely exact complexities of various NP-complete problems? © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Paturi, R. (2010). Exact algorithms and complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6175 LNCS, pp. 8–9). https://doi.org/10.1007/978-3-642-14186-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free