Re:Complex problem made simple sends computer scientists wild
by poizan42 on Friday November 13, 2015 @03:07AM
(#10558566)
If it was proven that it's not in P then we would have shown that P!=NP which would be HUGE.
No, this is "merely" finding a more efficient algorithm for a problem which we still don't know exactly where belongs. From a complexity theoretical viewpoint nothing is changed. It's still possible that graph isomorphism is in P.
Now if graph isomorphism is shown to be NP-complete then this result would imply that every problem in NP can be solved in sub-exponential time which would have huge practical consequences.
What is the needle and how did it shift significantly for the first time?
Edit: They already knew it was in NP, but now they know it is not in P (or not quite in P)?