A computer scientist has achieved a breakthrough in a nearly 25-year-old problem involving how computers calculate distances across enormous networks. The new algorithm delivers more reliable ...

People have performed many mathematical proofs to show that a quantum computer will vastly outperform traditional computers on a number of algorithms. But the quantum ...

See how AI is changing algorithm discovery, theorem proving, and complexity theory, with real research examples and a clear look at its limitations.

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal. Click to tell Google to ...

AI can help theoretical computer scientists search for algorithms, proof components, and combinatorial structures. Here’s what recent results show—and why verification still matters.

The original version of this story appeared in Quanta Magazine. Imagine a town with two widget merchants. Customers prefer cheaper widgets, so the merchants must compete to set the lowest price.