** Subscribe** to view the full document.

- Fall '09
- Computational complexity theory, NP-complete problems, Travelling salesman problem, NP-complete, Hamiltonian path problem