A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

Known today as Karatsuba’s Algorithm, this breakthrough challenged the long-held belief that multiplying two n-digit numbers required n² steps.