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

Algorithm type

6958 X^{3} Y^{3} Z^{3} + 378 X^{3} Y^{2} Z^{3} + 1627 X^{3} Y^{3} Z + 392 X^{3} Y^{2} Z^{2} + 1540 X^{2} Y^{3} Z^{2} + 378 X^{2} Y^{2} Z^{3} + 71 X^{3} Y^{2} Z + 116 X^{2} Y^{3} Z + 1013 X^{2} Y^{2} Z^{2} + 14 X^{2} Y Z^{3} + 91 X^{2} Y^{2} Z + X^{2} Y Z^{2} + 57 X Y^{3} Z + 14 X Y^{2} Z^{2} + 1684 X Y Z^{3} + 15 X^{2} Y Z + 119 X Y^{2} Z + 218 X Y Z^{2} + 155 X Y Z

Algorithm definition

The algorithm ⟨30×31×32:14841⟩ is taken from:

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

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