Monochromatic triangles, intermediate matrix products, and convolutions

Abstract

© Andrea Lincoln, Adam Polak, and Virginia Vassilevska Williams. The most studied linear algebraic operation, matrix multiplication, has surprisingly fast O(nω) time algorithms for ω < 2.373. On the other hand, the (min, +) matrix product which is at the heart of many fundamental graph problems such as All-Pairs Shortest Paths, has received only minor no(1) improvements over its brute-force cubic running time and is widely conjectured to require n3−o(1) time. There is a plethora of matrix products and graph problems whose complexity seems to lie in the middle of these two problems. For instance, the Min-Max matrix product, the Minimum Witness matrix product, All-Pairs Shortest Paths in directed unweighted graphs and determining whether an edge-colored graph contains a monochromatic triangle, can all be solved in Oe(n(3+ω)/2) time. While slight improvements are sometimes possible using rectangular matrix multiplication, if ω = 2, the best runtimes for these “intermediate” problems are all Oe(n2.5). A similar phenomenon occurs for convolution problems. Here, using the FFT, the usual (+, ×)- convolution of two n-length sequences can be solved in O(n log n) time, while the (min, +) convolution is conjectured to require n2−o(1) time, the brute force running time for convolution problems. There are analogous intermediate problems that can be solved in O(n1.5) time, but seemingly not much faster: Min-Max convolution, Minimum Witness convolution, etc. Can one improve upon the running times for these intermediate problems, in either the matrix product or the convolution world? Or, alternatively, can one relate these problems to each other and to other key problems in a meaningful way? This paper makes progress on these questions by providing a network of fine-grained reductions. We show for instance that APSP in directed unweighted graphs and Minimum Witness product can be reduced to both the Min-Max product and a variant of the monochromatic triangle problem, so that a significant improvement over n(3+ω)/2 time for any of the latter problems would result in a similar improvement for both of the former problems. We also show that a natural convolution variant of monochromatic triangle is fine-grained equivalent to the famous 3SUM problem. As this variant is solvable in O(n1.5) time and 3SUM is in O(n2) time (and is conjectured to require n2−o(1) time), our result gives the first fine-grained equivalence between natural problems of different running times. We also relate 3SUM to monochromatic triangle, and a coin change problem to monochromatic convolution, and thus to 3SUM.