Description of fast matrix multiplication algorithm: ⟨2×6×25:235⟩

Algorithm type

10X2Y4Z2+55X2Y2Z2+20XY4Z+40XY3Z+20XY2Z+90XYZ10X2Y4Z255X2Y2Z220XY4Z40XY3Z20XY2Z90XYZ10*X^2*Y^4*Z^2+55*X^2*Y^2*Z^2+20*X*Y^4*Z+40*X*Y^3*Z+20*X*Y^2*Z+90*X*Y*Z

Algorithm definition

The algorithm ⟨2×6×25:235⟩ is the (Kronecker) tensor product of ⟨2×6×5:47⟩ with ⟨1×1×5:5⟩.

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