3 ms·
It's not just "believed" that showing a polynomial-time algorithm for an NP-complete problem shows that P=NP; it's proven (in fact, this is part of the definiti
by umanwizard 9y ago
It's not just "believed" that showing a polynomial-time algorithm for an NP-complete problem shows that P=NP; it's proven (in fact, this is part of the definition of NP-complete...)