First page
Back
Continue
Last page
Overview
Graphics
Computability
Polynomial time
NP-Complete
Non-deterministic polynomial time
NP-Hard
Many optimisation problems are NP-complete or NP-hard
Hamilton path
Travelling salesman