New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science ...

A diagram showing the relevant complexity classes in the P vs NP problem. “P” problems are solvable in polynomial time; “NP” problems might be solvable in polynomial time, and are checkable in ...

A paper that leaked onto the Web late last week claims to have solved one of the great modern problems in mathematics and computer science. Vinay Deolalikar, a principal research scientist at HP labs, ...

Quantum computers get a lot of people excited because they solve problems in a manner that's fundamentally different from existing hardware. A certain class of mathematical problems, called ...

Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently ...