Description of fast matrix multiplication algorithm: ⟨30×32×32:14874⟩

Algorithm type

7336 X^{3} Y^{3} Z^{3} + 1684 X^{3} Y^{3} Z + 392 X^{3} Y^{2} Z^{2} + 1988 X^{2} Y^{3} Z^{2} + 392 X^{2} Y^{2} Z^{3} + 28 X^{3} Y^{2} Z + 146 X^{2} Y^{3} Z + 566 X^{2} Y^{2} Z^{2} + 90 X^{2} Y^{2} Z + 116 X Y^{3} Z + 28 X Y^{2} Z^{2} + 1712 X Y Z^{3} + 64 X Y^{2} Z + 208 X Y Z^{2} + 124 X Y Z

Algorithm definition

The algorithm ⟨30×32×32:14874⟩ is taken from:

Optimization techniques for small matrix multiplication. Theoretical Computer Science, 412(22):2219--2236, May 2011. [ DOI ]

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