Description of fast matrix multiplication algorithm: ⟨29×30×30:12588⟩

Algorithm type

6552 X^{3} Y^{3} Z^{3} + 1568 X^{3} Y^{3} Z + 378 X^{3} Y^{2} Z^{2} + 1120 X^{2} Y^{3} Z^{2} + 378 X^{2} Y^{2} Z^{3} + 28 X^{3} Y^{2} Z + 85 X^{2} Y^{3} Z + 476 X^{2} Y^{2} Z^{2} + 73 X^{2} Y^{2} Z + 28 X Y^{3} Z + 14 X Y^{2} Z^{2} + 1596 X Y Z^{3} + 30 X Y^{2} Z + 144 X Y Z^{2} + 118 X Y Z

Algorithm definition

The algorithm ⟨29×30×30:12588⟩ is the projection [[1, 0], [0]] of ⟨30×30×30:12710⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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