> If P equals NP, then you could solve anything as easily as you could verify it. This is the core oversimplification of the article—if P=NP there's no guarant

> If P equals NP, then you could solve anything as easily as you could verify it. This is the core oversimplification of the article—if P=NP there's no guarantee that the solution is as easy as the verification. O(n^3) is still more expensive than O(n^2), even though both are in P.