Description of fast matrix multiplication algorithm: ⟨5×5×13:227⟩

Algorithm type

X3Y2Z3+5X2Y3Z2+92X2Y2Z2+X2YZ2+2XY3Z+2XY2Z2+3XYZ3+40XY2Z+36XYZ2+45XYZX3Y2Z35X2Y3Z292X2Y2Z2X2YZ22XY3Z2XY2Z23XYZ340XY2Z36XYZ245XYZX^3*Y^2*Z^3+5*X^2*Y^3*Z^2+92*X^2*Y^2*Z^2+X^2*Y*Z^2+2*X*Y^3*Z+2*X*Y^2*Z^2+3*X*Y*Z^3+40*X*Y^2*Z+36*X*Y*Z^2+45*X*Y*Z

Algorithm definition

The algorithm ⟨5×5×13:227⟩ 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