Description of fast matrix multiplication algorithm: ⟨4×11×16:480⟩

Algorithm type

X^{4} Y^{5} Z^{4} + 18 X^{4} Y^{4} Z^{4} + X^{3} Y^{5} Z^{4} + X^{4} Y^{3} Z^{4} + 3 X^{2} Y^{7} Z^{2} + 4 X Y^{9} Z + X^{3} Y^{3} Z^{4} + 24 X^{2} Y^{6} Z^{2} + 8 X^{2} Y^{5} Z^{2} + 12 X Y^{7} Z + 19 X^{2} Y^{4} Z^{2} + 6 X Y^{6} Z + X Y^{5} Z^{2} + 5 X^{2} Y^{3} Z^{2} + 9 X Y^{5} Z + 103 X^{2} Y^{2} Z^{2} + 24 X Y^{4} Z + X Y^{3} Z^{2} + 2 X^{2} Y Z^{2} + 77 X Y^{3} Z + 18 X Y^{2} Z + 142 X Y Z

Algorithm definition

The algorithm ⟨4×11×16:480⟩ 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