Re:P≠NP proof update
by barrkel on Sunday August 15, 2010 @07:36PM
(#1606259)
I actually removed that point from my comment - that problems in P may be intractable, so it may be academic anyhow. But a way of turning NP-complete problems into problems in P (i.e. P = NP) would hopefully mean that intractable NP problems would be tractable P problems, even if only for relatively small values of n.
[ Parent
| on HN ]
Re:P≠NP proof update
by carbocation on Sunday August 15, 2010 @07:37PM
(#1606260)
Hopefully true, I agree.