complexity theory

2 articles · All tags

• The Traveling Salesman Problem: Why the Shortest Route Is Hard
  The traveling salesman problem asks for the shortest route that visits every city once and returns to the start, simple to state but very hard to solve.
• P vs NP
  P vs NP explained: why verifying solutions is easy but finding them may be hard, what polynomial time means, and why this Millennium Prize problem matters.