Description of fast matrix multiplication algorithm: ⟨8×10×10:528⟩

Algorithm type

24 X^{4} Y^{4} Z^{4} + X^{3} Y^{5} Z^{2} + X^{2} Y^{6} Z^{2} + X^{3} Y^{4} Z^{2} + 2 X^{2} Y^{4} Z^{3} + X^{2} Y^{3} Z^{4} + 10 X^{4} Y^{2} Z^{2} + 12 X^{2} Y^{4} Z^{2} + 10 X^{2} Y^{2} Z^{4} + X Y^{6} Z + X Y^{5} Z^{2} + 2 X^{2} Y^{4} Z + 2 X^{2} Y^{3} Z^{2} + X Y^{5} Z + 2 X Y^{4} Z^{2} + 4 X^{2} Y^{3} Z + 160 X^{2} Y^{2} Z^{2} + X Y^{4} Z + 2 X Y^{3} Z^{2} + X^{2} Y^{2} Z + 12 X Y^{3} Z + 4 X Y^{2} Z^{2} + 57 X^{2} Y Z + 73 X Y^{2} Z + 63 X Y Z^{2} + 80 X Y Z

Algorithm definition

The algorithm ⟨8×10×10:528⟩ 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