Description of fast matrix multiplication algorithm: ⟨5×6×8:170⟩

Algorithm type

70 X^{2} Y^{2} Z^{2} + 3 X Y^{3} Z + 2 X Y^{2} Z^{2} + X Y Z^{3} + 15 X^{2} Y Z + 29 X Y^{2} Z + 24 X Y Z^{2} + 26 X Y Z

Algorithm definition

The algorithm ⟨5×6×8:170⟩ is taken from:

Manuel Kauers and Issaac Wood. Exploring the meta flip graph for matrix multiplication. Technical Report 2510.19787, arXiv, October 2025. [ arXiv ]

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

These encodings are given in compressed text format using the maple computer algebra system. In each cases, the last line could be understood as a description of the encoding with respect to classical matrix multiplication algorithm. As these outputs are structured, one can construct easily a parser to its favorite format using the maple documentation without this software.

Back to main table