Description of fast matrix multiplication algorithm: ⟨9×9×15:760⟩

Algorithm type

64 X^{4} Y^{6} Z^{6} + 76 X^{2} Y^{6} Z^{6} + 16 X^{4} Y^{6} Z^{3} + 18 X^{2} Y^{5} Z^{6} + 2 X^{2} Y^{5} Z^{5} + 16 X^{3} Y^{6} Z^{2} + 32 X^{3} Y^{2} Z^{6} + 4 X^{2} Y^{6} Z^{3} + 64 X^{4} Y^{3} Z^{3} + 4 X^{3} Y^{6} Z + 22 X^{3} Y Z^{6} + 20 X^{2} Y^{5} Z^{3} + 18 X^{3} Y^{5} Z + 26 X^{3} Y Z^{5} + 2 X^{3} Y^{4} Z + 16 X^{3} Y^{2} Z^{3} + 192 X^{2} Y^{3} Z^{3} + 24 X^{3} Y Z^{3} + 144 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨9×9×15:760⟩ is taken from:

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

Algorithm description

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