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

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