Re:How would you responsibly disclose proof that p=np?
by tjgq on Tuesday March 12, 2013 @07:17AM
(#5361163)
Technically, you could prove P=NP without actually discovering a polynomial-time algorithm for an NP-hard problem. Not all proofs are constructive.
[ Parent
| on HN ]
There are no comments on this comment yet.