Description of fast matrix multiplication algorithm: ⟨3×15×16:534⟩

Algorithm type

X^{3} Y^{6} Z^{2} + 2 X^{3} Y^{5} Z^{2} + 6 X^{2} Y^{6} Z^{2} + 2 X^{2} Y^{5} Z^{2} + X Y^{6} Z^{2} + 3 X^{3} Y^{3} Z^{2} + 2 X^{3} Y^{2} Z^{3} + 30 X^{2} Y^{4} Z^{2} + X^{2} Y^{3} Z^{3} + 5 X Y^{6} Z + 3 X Y^{5} Z^{2} + X Y^{4} Z^{3} + X^{3} Y Z^{3} + 11 X^{2} Y^{3} Z^{2} + 2 X^{2} Y^{2} Z^{3} + 7 X Y^{4} Z^{2} + 3 X Y^{3} Z^{3} + 2 X^{3} Y Z^{2} + 130 X^{2} Y^{2} Z^{2} + 5 X^{2} Y Z^{3} + 19 X Y^{4} Z + 7 X Y^{3} Z^{2} + 15 X Y^{2} Z^{3} + 2 X^{3} Y Z + 25 X Y^{3} Z + 53 X Y^{2} Z^{2} + 33 X Y Z^{3} + 5 X^{2} Y Z + 71 X Y^{2} Z + 58 X Y Z^{2} + 28 X Y Z

Algorithm definition

The algorithm ⟨3×15×16:534⟩ 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