eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2011-01-27
1
22
10.4230/DagSemProc.10441.1
article
10441 Abstracts Collection – Exact Complexity of NP-hard Problems
Husfeldt, Thore
Kratsch, Dieter
Paturi, Ramamohan
Sorkin, Gregory B.
A decade before NP-completeness became the
lens through which Computer Science views computationally hard
problems, beautiful algorithms were discovered that are much better
than exhaustive search, for example
Bellman's 1962 dynamic programming treatment of the Traveling Salesman problem
and Ryser's 1963 inclusion--exclusion formula for the permanent.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol10441/DagSemProc.10441.1/DagSemProc.10441.1.pdf
Complexity
Algorithms
NP-hard Problems
Exponential Time
SAT
Graphs