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

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

IF YOU have ever struggled to complete classic Nintendo games, don’t feel bad – they are officially difficult. An analysis of the computational complexity of video games, including those in the Mario ...

Theoretical computer science is among the most esoteric, brain-numbing fields a person could attempt to wrap her head around. Perhaps that’s why some academics are putting up such an effort to inject ...