Description of fast matrix multiplication algorithm: ⟨9×10×12:668⟩

Algorithm type

64 X^{4} Y^{6} Z^{6} + 44 X^{3} Y^{6} Z^{6} + 48 X^{2} Y^{6} Z^{6} + 4 X Y^{6} Z^{6} + 32 X^{5} Y^{3} Z^{3} + 64 X^{4} Y^{3} Z^{3} + 21 X^{5} Y^{2} Z^{2} + 176 X^{3} Y^{3} Z^{3} + 15 X^{4} Y^{2} Z^{2} + 92 X^{2} Y^{3} Z^{3} + 36 X Y^{3} Z^{3} + 24 X^{3} Y^{2} Z + 24 X^{3} Y Z^{2} + 6 X^{2} Y^{2} Z + 6 X^{2} Y Z^{2} + 6 X Y^{2} Z + 6 X Y Z^{2}

Algorithm definition

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