There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...
... well not quite. There have been similar headlines elsewhere, but the truth is more subtle and we certainly don't have a rival to "Quicksort". One of the problems ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results