Lance Fortnow on the current status and future outlook of solving the P-NP problem.

Quick verification A quantum computer has been shown to be faster than a classical one at verifying the solution to an NP-complete problem when provided with only a ...

A new proof, published to the Web less than one week ago, purports to finally demonstrate that, in complexity theory, P != NP. As fast as the proof went up though, people found some potential issues ...