A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

The proof, known to be so hard that a mathematician once offered 10 martinis to whoever could figure it out, uses number ...

Two decades ago, the mathematician Moon Duchin spent her summers teaching geometry at Mathcamp, a program for mathematically talented teens. Campers contemplated notions such as how to prove whether a ...

UC Santa Barbara computer scientist Daniel Lokshtanov is advancing fundamental understanding of computational efficiency through groundbreaking research on quasi-polynomial time algorithms, supported ...