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

Algorithm type

XY4Z2+X2Y3Z+72X2Y2Z2+2X2YZ3+XYZ4+X2Y2Z+X2YZ2+2XY3Z+9X2YZ+36XY2Z+37XYZ2+15XYZXY4Z2X2Y3Z72X2Y2Z22X2YZ3XYZ4X2Y2ZX2YZ22XY3Z9X2YZ36XY2Z37XYZ215XYZX*Y^4*Z^2+X^2*Y^3*Z+72*X^2*Y^2*Z^2+2*X^2*Y*Z^3+X*Y*Z^4+X^2*Y^2*Z+X^2*Y*Z^2+2*X*Y^3*Z+9*X^2*Y*Z+36*X*Y^2*Z+37*X*Y*Z^2+15*X*Y*Z

Algorithm definition

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