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

  • Mathematics

  • Biology

  • Computer Science

  • Topics

  • Archive

What's up in

computational complexity

Mathematics

Theorists Draw Closer to Perfect Coloring

By Natalie Wolchover
October 20, 2015
Read Later

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

By John Pavlus
September 29, 2015
Read Later

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

By Thomas Lin +1 authors
Erica Klarreich
August 12, 2014
Read Later

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

traveling salesperson problem

Computer Scientists Take Road Less Traveled

By Erica Klarreich
January 29, 2013
Read Later

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


Previous
  • 1
  • 2
  • 3
  • 4
Next

The Quanta Newsletter

Get highlights of the most important news delivered to your email inbox

Recent newsletters


  • About Quanta
  • Archive
  • Contact Us
  • Terms & Conditions
  • Privacy Policy
  • Simons Foundation
All Rights Reserved © 2022