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?

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

Engines Podcast Engines of Our Ingenuity 3273: The P vs NP Problem Episode: 3273 The biggest unsolved question in computer science. Today, questions with answers that are hard to find, but easy to ...

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

Source: Darren Edwards What if one of the biggest unsolved problems in mathematics is not just about numbers or computers, but about observers like you and me? This isn’t a proposed solution to P vs ...

The following is an extract from our Lost in Space-Time newsletter. Each month, we hand over the keyboard to a physicist or mathematician to tell you about fascinating ideas from their corner of the ...

Mathematical puzzles don't often get to star in feature films, but P vs NP is the subject of an upcoming thriller from Timothy Lanzone called "Travelling Salesman". The titles refers to the ...

Imagine a parallel universe where physicists are remunerated so handsomely that they can accumulate multitudinous assets. In this alternate universe, you naturally wish to share your good fortune, so ...