Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proved that it’s “universally optimal.” ...

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

Three computer scientists have disproved a long-standing conjecture about a fundamental problem involving imperfect information.

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

A real-world example of an optimization problem could help ground some wacky terms like superposition and entanglement.

Building on a landmark algorithm, researchers propose a way to make a smaller and more noise-tolerant quantum factoring circuit for cryptography.

A quantum version of a computer algorithm widely used in finance, engineering and scientific modelling shows promising signs of operating much faster than existing methods. Experts say there are ...

The findings, published in IEEE Transactions on Consumer Electronics, present a way to protect sensitive videos from rare but extremely powerful computers.