Re:A Solution of the P versus NP Problem?
by bottombutton on Monday August 14, 2017 @01:35PM
(#15010600)
Kind of like proving that you can't solve the halting problem, it lets us put to rest the idea that you can reduce the complexity of NP problems to a deterministic polynomial solution. The collective brainpower can be used to solve other problems.
[ Parent
| on HN ]
There are no comments on this comment yet.