In recent years, a new “fine-grained” theory of computational hardness has been developed,
based on “fine-grained reductions” that focus on exact running times for problems …

The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

We consider several well-studied problems in dynamic algorithms and prove that sufficient
progress on any of them would imply a breakthrough on one of five major open problems in …

The k-SAT problem is to determine if a given k-CNF has a satisfying assignment. It is a
celebrated open question as to whether it requires exponential time to solve k-SAT for k⩾ 3 …

Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

For several NP-complete problems, there have been a progression of better but still
exponential algorithms. In this paper, we address the relative likelihood of sub-exponential …

Exact exponential algorithms Page 1 80 coMMunicATions of ThE AcM | MARCh 2013 | Vol. 56
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …

We discuss fast exponential time solutions for NP-complete problems. We survey known
results and approaches, we provide pointers to the literature, and we discuss several open …

Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …

Classic similarity measures of strings are longest common subsequence and Levenshtein
distance (ie, The classic edit distance). A classic similarity measure of curves is dynamic …