Hacker News new | ask | show | jobs
by babypistol 2946 days ago
In my opinion P = NP does not mean that. There still might be a big polynomial difference between verifying a solution and finding one.
1 comments

Of course, the concrete costs can be different; I was talking asymptotically :)
Well that's the problem, man.

And asymptotically is not the right word either, because n^3 is asymptotically different from n^2. You probably meant poly-time reducible, whichs is quite different from "the same".