Description of fast matrix multiplication algorithm: ⟨3×10×14:312⟩

Algorithm type

8⁢X2⁢Y3⁢Z2+100⁢X2⁢Y2⁢Z2+8⁢X⁢Y4⁢Z+8⁢X3⁢Y⁢Z+16⁢X⁢Y3⁢Z+24⁢X⁢Y2⁢Z2+16⁢X⁢Y⁢Z3+8⁢X2⁢Y⁢Z+60⁢X⁢Y2⁢Z+56⁢X⁢Y⁢Z2+8⁢X⁢Y⁢Z8X2Y3Z2100X2Y2Z28XY4Z8X3YZ16XY3Z24XY2Z216XYZ38X2YZ60XY2Z56XYZ28XYZ8*X^2*Y^3*Z^2+100*X^2*Y^2*Z^2+8*X*Y^4*Z+8*X^3*Y*Z+16*X*Y^3*Z+24*X*Y^2*Z^2+16*X*Y*Z^3+8*X^2*Y*Z+60*X*Y^2*Z+56*X*Y*Z^2+8*X*Y*Z

Algorithm definition

The algorithm ⟨3×10×14:312⟩ 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