Computer Scientists Find a Key Research Algorithm's Limits The most widely used technique for optimizing values of a math function turns out to be a fundamentally difficult computational problem.

In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

Main Shor's factoring algorithm consists of a quantum order-finding algorithm, preceded and succeeded by various classical routines.