Monochromatic Triangles, Intermediate Matrix Products, and Convolutions

The most studied linear algebraic operation, matrix multiplication, has surprisingly fast $O(n^\omega)$ time algorithms for $\omega<2.373$. On the other hand, the $(\min,+)$ matrix product which is at the heart of many fundamental graph problems such as APSP, has received only minor improvements over its brute-force cubic running time and is widely conjectured to require $n^{3-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, APSP in directed unweighted graphs and determining whether an edge-colored graph contains a monochromatic triangle, can all be solved in $\tilde O(n^{(3+\omega)/2})$ time. A similar phenomenon occurs for convolution problems, where analogous intermediate problems can be solved in $\tilde O(n^{1.5})$ time. 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. 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(n^{1.5})$ time and 3SUM is in $O(n^2)$ time (and is conjectured to require $n^{2-o(1)}$ time), our result gives the first fine-grained equivalence between natural problems of different running times.

[1]  Tsvi Kopelowitz,et al.  Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.

[2]  Marek Cygan,et al.  On problems equivalent to (min, +)-convolution , 2017, ICALP.

[3]  Timothy M. Chan,et al.  More on Change-Making and Related Problems , 2020, ESA.

[4]  Erik D. Demaine,et al.  Subquadratic Algorithms for 3SUM , 2005, Algorithmica.

[5]  Raphael Yuster,et al.  Finding heaviest H-subgraphs in real weighted graphs, with applications , 2006, TALG.

[6]  François Le Gall,et al.  Powers of tensors and fast matrix multiplication , 2014, ISSAC.

[7]  Allan Grønlund Jørgensen,et al.  Threesomes, Degenerates, and Love Triangles , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[8]  Timothy M. Chan More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard Problems , 2018, SODA.

[9]  Raphael Yuster,et al.  All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time , 2009, Theory Comput..

[10]  Jirí Matousek,et al.  Computing Dominances in E^n , 1991, Inf. Process. Lett..

[11]  Noga Alon,et al.  On the Exponent of the All Pairs Shortest Path Problem , 1991, J. Comput. Syst. Sci..

[12]  Przemyslaw Uznanski,et al.  Hamming Distance Completeness , 2019, CPM.

[13]  Uri Zwick,et al.  All pairs shortest paths using bridging sets and rectangular matrix multiplication , 2000, JACM.

[14]  Martin Dietzfelbinger,et al.  Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes , 1996, STACS.

[15]  Ryan Williams,et al.  An Equivalence Class for Orthogonal Vectors , 2018, SODA.

[16]  Andrzej Lingas,et al.  Faster algorithms for finding lowest common ancestors in directed acyclic graphs , 2007, Theor. Comput. Sci..

[17]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

[18]  Allan Grønlund Jørgensen,et al.  A Dichotomy for Regular Expression Membership Testing , 2016, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[19]  Silvio Lattanzi,et al.  MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond , 2019, ArXiv.

[20]  Timothy M. Chan,et al.  Necklaces, Convolutions, and X+Y , 2006, Algorithmica.

[21]  Virginia Vassilevska Williams,et al.  Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.

[22]  V. V. Williams ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY , 2019, Proceedings of the International Congress of Mathematicians (ICM 2018).

[23]  Tsvi Kopelowitz,et al.  {-1, 0, 1}-APSP and (min, max)-Product Problems , 2019, ArXiv.

[24]  Steven Skiena,et al.  Finding least common ancestors in directed acyclic graphs , 2001, SODA '01.

[25]  Michael J. Fischer,et al.  Boolean Matrix Multiplication and Transitive Closure , 1971, SWAT.

[26]  Marvin Künnemann,et al.  Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max , 2019, STOC.

[27]  Marvin Künnemann,et al.  On the Fine-grained Complexity of One-Dimensional Dynamic Programming , 2017, ICALP.

[28]  Joshua R. Wang,et al.  Deterministic Time-Space Tradeoffs for k-SUM , 2016, ICALP.

[29]  Mark H. Overmars,et al.  On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..

[30]  Raphael Yuster,et al.  All-pairs bottleneck paths for general graphs in truly sub-cubic time , 2007, STOC '07.

[31]  Virginia Vassilevska Williams,et al.  Nondecreasing paths in a weighted graph or: How to optimally read a train schedule , 2010, TALG.

[32]  François Le Gall,et al.  Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor , 2017, SODA.

[33]  Raimund Seidel,et al.  On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs , 1995, J. Comput. Syst. Sci..

[34]  V. Strassen Gaussian elimination is not optimal , 1969 .

[35]  Ryan Williams,et al.  Faster all-pairs shortest paths via circuit complexity , 2013, STOC.

[36]  Mihai Patrascu,et al.  Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.

[37]  Fabrizio Grandoni,et al.  Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter , 2015, SODA.

[38]  Raphael Yuster,et al.  Efficient algorithms on sets of permutations, dominance, and real-weighted APSP , 2009, SODA.

[39]  Virginia Vassilevska Williams,et al.  Equivalences between triangle and range query problems , 2020, SODA.

[40]  Raphael Yuster,et al.  All-Pairs Bottleneck Paths in Vertex Weighted Graphs , 2007, SODA '07.

[41]  Yoshio Okamoto,et al.  On Problems as Hard as CNF-SAT , 2011, 2012 IEEE 27th Conference on Computational Complexity.

[42]  Andrzej Lingas,et al.  Finding a heaviest triangle is not harder than matrix multiplication , 2007, SODA '07.

[43]  J. W. Wright The Change-Making Problem , 1975, JACM.

[44]  Ran Duan,et al.  Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths , 2009, SODA.

[45]  Ran Duan,et al.  Faster Algorithms for All Pairs Non-decreasing Paths Problem , 2019, ICALP.

[46]  Ryan Williams,et al.  Finding, minimizing, and counting weighted subgraphs , 2009, STOC '09.

[47]  Micha Sharir,et al.  Dominance Product and High-Dimensional Closest Pair under L_infty , 2017, ISAAC.