One computer scientist’s “stunning” proof is the first progress in 50 years on one of the most famous questions in computer science.

EPFL Professor Giuseppe Carleo and a graduate student from Columbia University named Matija Medvidović have found a way to execute a complex quantum computing algorithm on a traditional computer.

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs ...

Researchers have devised an "absurdly fast" algorithm to solve the problem of finding the fastest flow through a network.

On July 24 at the Global Quantum Forum in Chicago, IBM and the University of Chicago announced their intent to offer Duality ...