5 ms·
Technically, you could prove P=NP without actually discovering a polynomial-time algorithm for an NP-hard problem. Not all proofs are constructive.
by tjgq 14y ago
Technically, you could prove P=NP without actually discovering a polynomial-time algorithm for an NP-hard problem. Not all proofs are constructive.