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

When computer scientists hang out at cocktail parties, they're apt to chat, among other things, about the single most important unsolved problem in computer science: the question, Does P = NP?

Has the biggest question in computer science been solved? On 6 August, Vinay Deolalikar, a mathematician at Hewlett-Packard Labs in Palo Alto, California, sent out draft copies of a paper titled ...

I looked into the “P versus NP problem” on Christmas Day (25 December 2010, p 24), and am happy to confirm that Presents (P) most definitely do not equal No Presents (NP). I claim my $1 million ...