NP-What? Complexity Types of Optimization Problems Explained
An introduction to one of the central questions in computer science
Published in
11 min readAug 17, 2023
How come the shortest path problem is easy to solve, but the traveling salesman problem is not? What are the mathematical ideas on this? How to determine if a problem will take an unmanageable number of steps if its size increases? In this post you…