Description of fast matrix multiplication algorithm: ⟨4×5×10:150⟩

Algorithm type

8 X^{4} Y^{2} Z^{2} + 8 X^{4} Y Z + 42 X^{2} Y^{2} Z^{2} + X^{3} Y Z + X Y^{3} Z + 7 X^{2} Y Z + 20 X Y^{2} Z + 13 X Y Z^{2} + 50 X Y Z

Algorithm definition

The algorithm ⟨4×5×10:150⟩ is taken from:

Andrew I. Perminov. Fast matrix multiplication via ternary meta flip graphs. Technical report, arXiv, November 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