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 ...

NP is the set of decision problems whose solutions can be verified in polynomial time, but for some of these problems no polynomial algorithm is known. A problem is NP-hard if an algorithm for solving ...