News for hackers. Stuff that matters.
Re:GetACoder.com: Solve P Vs NP by eru on Monday August 16, 2010 @12:20PM (#1608223)
Factoring numbers is already suspected to be much easier than NP-complete.

That is because factoring prime numbers is in the intersection between NP and co-NP. Co-NP is the set of problems where a "NO" answer is easily checkable with a certificate. If NP ?= co-NP is as much a question as P ?= NP. (I.e. no known proof either way, but every expects them to be unequal.)

There are no comments on this comment yet.