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

Algorithm type

X^{4} Y^{8} Z^{2} + X^{4} Y^{6} Z^{4} + 2 X^{4} Y^{4} Z^{6} + 9 X^{4} Y^{4} Z^{4} + 3 X^{2} Y^{6} Z^{4} + X^{2} Y^{4} Z^{6} + 4 X^{6} Y^{2} Z^{2} + X^{4} Y^{4} Z^{2} + X^{2} Y^{6} Z^{2} + 6 X^{2} Y^{4} Z^{4} + 4 X^{2} Y^{2} Z^{6} + 4 X^{2} Y^{4} Z^{2} + X^{2} Y^{2} Z^{4} + 6 X^{2} Y^{4} Z + 8 X^{2} Y^{3} Z^{2} + 12 X^{2} Y^{2} Z^{3} + 63 X^{2} Y^{2} Z^{2} + 18 X Y^{3} Z^{2} + 8 X Y^{2} Z^{3} + 24 X^{3} Y Z + 6 X^{2} Y^{2} Z + 6 X Y^{3} Z + 36 X Y^{2} Z^{2} + 24 X Y Z^{3} + 30 X Y^{2} Z + 14 X Y Z^{2} + 34 X Y Z

Algorithm definition

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