Description of fast matrix multiplication algorithm: ⟨6×8×16:510⟩

Algorithm type

2 X^{4} Y^{5} Z^{4} + 22 X^{4} Y^{4} Z^{4} + 6 X^{6} Y^{2} Z^{2} + 14 X^{2} Y^{6} Z^{2} + 10 X^{2} Y^{4} Z^{4} + 6 X^{2} Y^{2} Z^{6} + 10 X^{2} Y^{5} Z^{2} + 14 X^{2} Y^{3} Z^{4} + 19 X^{2} Y^{4} Z^{2} + 4 X^{2} Y^{2} Z^{4} + 26 X Y^{6} Z + 17 X^{2} Y^{3} Z^{2} + 7 X Y^{5} Z + 32 X Y^{4} Z^{2} + 86 X^{2} Y^{2} Z^{2} + 6 X Y^{4} Z + 11 X Y^{3} Z^{2} + X Y Z^{4} + 36 X^{3} Y Z + 41 X Y^{3} Z + 43 X Y^{2} Z^{2} + 36 X Y Z^{3} + 43 X Y^{2} Z + 10 X Y Z^{2} + 8 X Y Z

Algorithm definition

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