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.

A teenage programmer tests a set of instructions she has written to get her computer to mop the floor. Suitable for teaching at KS3, KS4 and National 4 and 5.

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

The authors do not work for, consult, own shares in or receive funding from any company or organization that would benefit from this article, and have disclosed no relevant affiliations beyond their ...

What do encrypted messages, recognizing speech commands and running simulations to predict the weather have in common? They all rely on matrix multiplication for accurate calculations. DeepMind, an ...

A 20-year-old algorithm that demonstrated the benefit of using quantum mechanics to solve certain problems has finally been run on a quantum computer. Simon’s algorithm, proposed by computer scientist ...

For decades, the graph isomorphism problem has held a special status within complexity theory. While thousands of other computational problems have meekly succumbed to categorization as either hard or ...

The exponential growth in computer processing power seen over the past 60 years may soon come to a halt. Complex systems such as those used in weather forecast, for example, require high computing ...

“LET’S do it again,” calls a ten-year-old. Once more, pupils clasping printed numbers follow tangled lines marked with white tape on the floor of their school hall. When two meet, the one holding the ...