Description of fast matrix multiplication algorithm: ⟨12×24×25:4160⟩

Algorithm type

32 X^{9} Y^{12} Z^{6} + 16 X^{9} Y^{11} Z^{6} + 16 X^{9} Y^{10} Z^{6} + 48 X^{9} Y^{12} Z^{3} + 24 X^{9} Y^{11} Z^{3} + 24 X^{9} Y^{10} Z^{3} + 48 X^{3} Y^{12} Z^{2} + 432 X^{6} Y^{6} Z^{4} + 72 X^{3} Y^{12} Z + 16 X^{3} Y^{11} Z^{2} + 80 X^{6} Y^{5} Z^{4} + 24 X^{3} Y^{11} Z + 648 X^{6} Y^{6} Z^{2} + 120 X^{6} Y^{5} Z^{2} + 992 X^{3} Y^{3} Z^{2} + 1488 X^{3} Y^{3} Z + 32 X^{3} Y^{2} Z^{2} + 48 X^{3} Y^{2} Z

Algorithm definition

The algorithm ⟨12×24×25:4160⟩ is the projection [[0, 0], [26]] of ⟨12×24×26:4160⟩.

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