Is it possible to invent a computer that computes anything in a flash? Or could some problems stump even the most powerful of computers? Computational complexity theorists study these questions and ...

PITTSBURGH—Computer scientists at Carnegie Mellon University and the Russian Academy of Science will share the Association for Computing Machinery's 2007 Gödel Prize for their seminal work on what ...

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

They have a mathematical, analog “solver” that can potentially find the best solution to NP-hard problems. NP-hardness is a theory of computational complexity, with problems that are famous for their ...

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