Description of fast matrix multiplication algorithm: ⟨7×9×10:433⟩

Algorithm type

10 X^{4} Y^{4} Z^{4} + 10 X^{3} Y^{4} Z^{4} + 3 X^{2} Y^{6} Z^{2} + 10 X^{5} Y^{2} Z^{2} + X^{3} Y^{4} Z^{2} + 18 X^{4} Y^{2} Z^{2} + 14 X^{2} Y^{4} Z^{2} + X^{3} Y^{3} Z + 32 X^{3} Y^{2} Z^{2} + X Y^{4} Z^{2} + 14 X^{3} Y^{2} Z + 2 X^{3} Y Z^{2} + 2 X^{2} Y^{3} Z + 60 X^{2} Y^{2} Z^{2} + 54 X^{3} Y Z + 24 X^{2} Y^{2} Z + 2 X^{2} Y Z^{2} + 4 X Y^{3} Z + 13 X Y^{2} Z^{2} + 71 X^{2} Y Z + 24 X Y^{2} Z + 6 X Y Z^{2} + 57 X Y Z

Algorithm definition

The algorithm ⟨7×9×10:433⟩ 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