Faster Exact Solutions for NP-Hard Problems

We seek out faster exact solutions for NP-hard problems not only for their own sake, but also in order to gain insights into complexity. This workshop is organized to specifically examine the following topics for NP-hard problems:

  1. Algorithms with improved exponential-time complexity
  2. Relationships among the complexities
  3. Obstacles to subexponential algorithms
  4. Heuristics for faster exponential-time algorithms and empirical studies
The workshop will consist mostly of short presentations (30 minutes) and one or two full-length presentations (60 minutes).

Questions? Please contact the organizers: Mohan Paturi and Richard Beigel