Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

Computational complexity and equilibrium analysis form an interrelated field at the crossroads of theoretical computer science and game theory. Researchers in this area investigate the intrinsic ...

Lance Fortnow on the current status and future outlook of solving the P-NP problem.

Henry Yuen is developing a new mathematical language to describe problems whose inputs and outputs aren’t ordinary numbers.

Imagine you’re on a quest to understand the very nature of computation. You’re deep in the wilderness, far from any paths, and inscrutable messages are carved into the trunks of trees all around you — ...

The basic mathematics of quantum mechanics will be reviewed for application to quantum computation. Classical physical computation (not with digital circuits) will be discussed, in particular ...

The research team of Assistant Professor Miyaji of the Department of Electrical and Electronic Information Engineering at Toyohashi University of Technology has developed a self-interference ...