Re:P ≠ NP
by faboo on Sunday August 08, 2010 @09:53PM
(#1586745)
It isn't actually _necessary_ for a P=NP proof to be constructive. A constructive proof would probably be easier to reason through, but it is prossible to prove the existence of an algorithm without providing one.
[ Parent
| on HN ]
There are no comments on this comment yet.