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

In 1994, a mathematician figured out how to make a quantum computer do something that no ordinary classical computer could. The work revealed that, in principle, a machine based on the rules of ...

For decades, the graph isomorphism problem has held a special status within complexity theory. While thousands of other computational problems have meekly succumbed to categorization as either hard or ...

Ian Stewart's Visions of Infinity: The Great Mathematical Problems is an entertaining and fresh look at some of the most vexing problems facing the field of mathematics. We asked him to pick the ...

In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

The biggest problem in computer science remains unsolved, but researchers are more confident than ever about what the answer should be. A new poll reveals opinions on the P versus NP problem, the ...

MILLENNIUM PRIZE SERIES: The Millennium Prize Problems are seven mathematics problems laid out by the Clay Mathematics Institute in 2000. They’re not easy – a correct solution to any one results in a ...