We care about your data, and we'd like to use cookies to give you a smooth browsing experience. Please agree and read more about our privacy policy.
What's up in
computational complexity
Mathematics
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
A Grand Vision for the Impossible
Subhash Khot’s bold conjecture is helping mathematicians explore the precise limits of computation.
traveling salesperson 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.
Next