Description of fast matrix multiplication algorithm: ⟨4×5×13:191⟩

Algorithm type

3 X^{2} Y^{3} Z^{2} + X^{2} Y^{2} Z^{3} + 2 X Y^{5} Z + 65 X^{2} Y^{2} Z^{2} + 2 X Y^{4} Z + 2 X Y^{3} Z^{2} + X Y^{2} Z^{3} + 2 X Y Z^{4} + 12 X Y^{3} Z + 10 X Y^{2} Z^{2} + 2 X Y Z^{3} + X^{2} Y Z + 30 X Y^{2} Z + 30 X Y Z^{2} + 28 X Y Z

Algorithm definition

The algorithm ⟨4×5×13:191⟩ is taken from:

Andrew I. Perminov. FastMatrixMultiplication, GitHub, February 2026. [ GitHub repository ]

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