Links to other lists of results

The compendium of NP optimization problems is not the only comprehensive compilation on the web of results for problems in theoretical computer science. Here are some other links. If you want us to extend this list, please contact Viggo Kann.

Complexity classes (Complexity Zoo).
Complexity results of scheduling problems.
TSPBIB, traveling salesperson problem.
Hamiltonian cycle and path problems.
Parameterized complexity results.
A compendium of problems complete for symmetric logarithmic space.
A list of P-complete problems.
The Stony Brook algorithm repository.

Back to the compendium of NP optimization problems.

Last changed June 2005 by <viggo@nada.kth.se>.