New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science. But the way to do it, according to Cameron Seth, a Ph.D. researcher ...

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?

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

Complexity theory remains one of the great unsolved mathematical puzzles. Kenneth Regan is trying to figure it out. Kenneth Regan paused at lunch in New York to glance at incoming texts from top ...