What's up in

computational complexity

Computer Science

Landmark Algorithm Breaks 30-Year Impasse

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field.


Theorists Draw Closer to Perfect Coloring

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof.

Computer Science

A New Map Traces the Limits of Computation

A major advance in computational complexity reveals deep connections between the classes of problems that computers can — and can’t — possibly do.

2014 Fields Medal and Nevanlinna Prize Winners

A Grand Vision for the Impossible

Subhash Khot’s bold conjecture is helping mathematicians explore the precise limits of computation.

traveling salesman problem

Computer Scientists Take Road Less Traveled

An infinitesimal advance in the traveling salesman problem breathes new life into the search for improved approximate solutions.