Description of fast matrix multiplication algorithm: ⟨3×4×8:73⟩

Algorithm type

2 X^{2} Y^{4} Z^{2} + 2 X Y^{4} Z^{3} + 4 X^{2} Y^{3} Z^{2} + 7 X^{2} Y^{2} Z^{3} + 10 X^{2} Y^{2} Z^{2} + 3 X Y^{4} Z + 4 X Y^{3} Z^{2} + 5 X Y^{2} Z^{3} + X^{2} Y^{2} Z + 14 X Y Z^{3} + 2 X Y^{2} Z + 7 X Y Z^{2} + 12 X Y Z

Algorithm definition

The algorithm ⟨3×4×8:73⟩ 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