If P=NP, then it’s possible to solve every problem whose solutions are easy to verify, says Stephens-Davidowitz. So, if this inequality persists, the general knapsack problem will always be hard.

Knapsack problems are tricky. First time I read the traveling salesman problem, I didn't expect it to have a time complexity of polynomial time.

Need to brush up my study into quantum computing.