Y
Hacker News
new
|
ask
|
show
|
jobs
by
SenorWilson
4932 days ago
Basically prove/disprove a p-np problem can be solved(in polynomial time) then you've proved it for the rest of the p-np problems.
1 comments
emillon
4932 days ago
I think that you mean a NP-complete problem. There's no such thing as a "p-np problem".
link