Faster Algorithms for Rectangular Matrix Multiplication

Let α be the maximal value such that the product of an n × n<sup>α</sup> matrix by an n<sup>α</sup> × n matrix can be computed with n<sup>2+o(1)</sup> arithmetic operations. In this paper we show that α >; 0.30298, which improves the previous record α >; 0.29462 by Coppersmith (Journal of Complexity, 1997). More generally, we construct a new algorithm for multiplying an n × n<sup>k</sup> matrix by an n<sup>k</sup> × n matrix, for any value k ≠ 1. The complexity of this algorithm is better than all known algorithms for rectangular matrix multiplication. In the case of square matrix multiplication (i.e., for k = 1), we recover exactly the complexity of the algorithm by Coppersmith and Winograd (Journal of Symbolic Computation, 1990). These new upper bounds can be used to improve the time complexity of several known algorithms that rely on rectangular matrix multiplication. For example, we directly obtain a O(n<sup>2.5302</sup>)-time algorithm for the all-pairs shortest paths problem over directed graphs with small integer weights, where n denotes the number of vertices, and also improve the time complexity of sparse square matrix multiplication.

[1]  Christopher Umans.  Group-theoretic algorithms for matrix multiplication , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

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

[3]  F. Behrend.  On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1946, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Piotr Sankowski,et al.  Dynamic transitive closure via dynamic matrix inverse: extended abstract , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[5]  Giuseppe F. Italiano,et al.  Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6]  Mihai Patrascu,et al.  On the possibility of faster SAT algorithms , 2010, SODA '10.

[7]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[8]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[9]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[10]  Grazia Lotti,et al.  On the Asymptotic Complexity of Rectangular Matrix Multiplication , 1983, Theor. Comput. Sci..

[11]  Noga Alon,et al.  Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover , 2007, ESA.

[12]  Volker Strassen,et al.  The asymptotic spectrum of tensors and the exponent of matrix multiplication , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[13]  Victor Y. Pan,et al.  Fast Rectangular Matrix Multiplication and Applications , 1998, J. Complex..

[14]  Rasmus Pagh,et al.  Faster join-projects and sparse matrix multiplications , 2009, ICDT '09.

[15]  Journal für die reine und angewandte Mathematik , 1893 .

[16]  Raphael Yuster,et al.  Fast sparse matrix multiplication , 2004, TALG.

[17]  Ryan Williams.  Nonuniform ACC Circuit Lower Bounds , 2014, JACM.

[18]  Don Coppersmith,et al.  Rectangular Matrix Multiplication Revisited , 1997, J. Complex..

[19]  Arnold Schönhage,et al.  Partial and Total Matrix Multiplication , 1981, SIAM J. Comput..

[20]  Piotr Sankowski,et al.  Fast Dynamic Transitive Closure with Lookahead , 2010, Algorithmica.

[21]  Asaf Shapira,et al.  All-Pairs Shortest Paths with a Sublinear Additive Error , 2008, ICALP.

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

[23]  D. Coppersmiths.  RAPID MULTIPLICATION OF RECTANGULAR MATRICES * , 2014 .

[24]  Noga Alon,et al.  On sunflowers and matrix multiplication , 2012, 2012 IEEE 27th Conference on Computational Complexity.

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

[26]  Christopher Umans,et al.  A group-theoretic approach to fast matrix multiplication , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[27]  Haim Kaplan,et al.  Colored intersection searching via sparse rectangular matrix multiplication , 2006, SCG '06.

[28]  Raphael Yuster,et al.  Computing the diameter polynomially faster than APSP , 2010, ArXiv.

[29]  Ryan Williams,et al.  Non-uniform ACC Circuit Lower Bounds , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[30]  HuangXiaohan,et al.  Fast Rectangular Matrix Multiplication and Applications , 1998 .

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

[32]  V. Strassen.  Relative bilinear complexity and matrix multiplication. , 1987 .

[33]  Uri Zwick,et al.  All pairs lightest shortest paths , 1999, STOC '99.

[34]  Asaf Shapira,et al.  All-pairs shortest paths with a sublinear additive error , 2008, TALG.

[35]  Raphael Yuster,et al.  Detecting short directed cycles using rectangular matrix multiplication and dynamic programming , 2004, SODA '04.

[36]  R. Salem,et al.  On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1942, Proceedings of the National Academy of Sciences of the United States of America.

[37]  Haim Kaplan,et al.  Counting colors in boxes , 2007, SODA '07.

[38]  A. J. Stothers.  On the complexity of matrix multiplication , 2010 .

[39]  V. Pan,et al.  Fast rectangular matrix multiplication and some applications , 2008 .