Description of fast matrix multiplication algorithm: ⟨5×6×10:216⟩

Algorithm type

6X4Y4Z4+2X3Y4Z3+3X2Y2Z4+16X2Y2Z3+43X2Y2Z2+2X2Y2Z+2XY2Z2+18XYZ3+26XY2Z+42XYZ2+56XYZ6X4Y4Z42X3Y4Z33X2Y2Z416X2Y2Z343X2Y2Z22X2Y2Z2XY2Z218XYZ326XY2Z42XYZ256XYZ6*X^4*Y^4*Z^4+2*X^3*Y^4*Z^3+3*X^2*Y^2*Z^4+16*X^2*Y^2*Z^3+43*X^2*Y^2*Z^2+2*X^2*Y^2*Z+2*X*Y^2*Z^2+18*X*Y*Z^3+26*X*Y^2*Z+42*X*Y*Z^2+56*X*Y*Z

Algorithm definition

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