Re:A Solution of the P versus NP Problem?
by petters on Tuesday August 15, 2017 @04:29AM
(#15016433)
> Proving P=NP doesn't magically create the algorithm, it just proves that there is one.
This is 100% true for all practical purposes. But there is an explicit algorithm for NP-complete problems that runs in polynomial time iff P=NP. The Wikipedia page has it written down. https://en.m.wikipedia.org/wiki/P_versus_NP_problem
This is 100% true for all practical purposes. But there is an explicit algorithm for NP-complete problems that runs in polynomial time iff P=NP. The Wikipedia page has it written down. https://en.m.wikipedia.org/wiki/P_versus_NP_problem