We present a new randomized method for computing the min-plus product (a.k.a., tropical product) of two n × n matrices, yielding a faster algorithm for solving the all-pairs shortest path problem (APSP) in dense n-node directed graphs with arbitrary edge weights. On the real RAM, where additions and comparisons of reals are unit cost (but all other operations have typical logarithmic cost), the algorithm runs in time and is correct with high probability. On the word RAM, the algorithm runs in n 3 /2 The new algorithm applies a tool from circuit complexity, namely the Razborov-Smolensky polynomials for approximately representing AC 0 [p] circuits, to efficiently reduce a matrix product over the (min, +) algebra to a relatively small number of rectangular matrix products over F2, each of which are computable using a particularly efficient method due to Coppersmith. We also give a deterministic version of the algorithm running in n 3 /2 log δ n time for some δ > 0, which utilizes the Yao-Beigel-Tarui translation of AC 0 [m] circuits into "nice" depth-two circuits.
Two years ago, Williams REF used techniques from circuit complexity, namely the polynomial method, to shave all polylogs, thus obtaining the current best bound for APSP, n 3 /2 Θ(
Faster all-pairs shortest paths via circuit complexity
STOC '14
Mathematics Computer Science