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

Algorithm type

10 X^{4} Y^{8} Z^{8} + 28 X^{4} Y^{8} Z^{6} + 10 X^{4} Y^{8} Z^{4} + 2 X^{4} Y^{4} Z^{8} + 28 X^{2} Y^{8} Z^{4} + 10 X^{2} Y^{4} Z^{8} + 22 X^{2} Y^{4} Z^{7} + 20 X^{2} Y^{8} Z^{2} + 16 X^{2} Y^{4} Z^{6} + 4 X^{2} Y^{2} Z^{8} + 22 X^{2} Y^{4} Z^{5} + 10 X^{2} Y^{4} Z^{4} + 44 X Y^{4} Z^{4} + 64 X^{2} Y^{4} Z^{2} + 84 X^{2} Y^{2} Z^{4} + 28 X Y^{4} Z^{3} + 28 X^{2} Y^{2} Z^{2} + 72 X Y^{4} Z + 116 X Y Z^{4} + 52 X Y Z^{3} + 152 X Y Z

Algorithm definition

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