Description of fast matrix multiplication algorithm: ⟨5×5×11:195⟩

Algorithm type

X2Y2Z3+XY5Z+79X2Y2Z2+2XY4Z+XY2Z3+X2YZ2+2XY3Z+4XY2Z2+2XYZ3+3X2YZ+36XY2Z+35XYZ2+28XYZX2Y2Z3XY5Z79X2Y2Z22XY4ZXY2Z3X2YZ22XY3Z4XY2Z22XYZ33X2YZ36XY2Z35XYZ228XYZX^2*Y^2*Z^3+X*Y^5*Z+79*X^2*Y^2*Z^2+2*X*Y^4*Z+X*Y^2*Z^3+X^2*Y*Z^2+2*X*Y^3*Z+4*X*Y^2*Z^2+2*X*Y*Z^3+3*X^2*Y*Z+36*X*Y^2*Z+35*X*Y*Z^2+28*X*Y*Z

Algorithm definition

The algorithm ⟨5×5×11:195⟩ 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