Description of fast matrix multiplication algorithm: ⟨29×31×32:14705⟩

Algorithm type

6268 X^{3} Y^{3} Z^{3} + 338 X^{3} Y^{2} Z^{3} + 1518 X^{3} Y^{3} Z + 351 X^{3} Y^{2} Z^{2} + 2136 X^{2} Y^{3} Z^{2} + 338 X^{2} Y^{2} Z^{3} + 67 X^{3} Y^{2} Z + 168 X^{2} Y^{3} Z + 1032 X^{2} Y^{2} Z^{2} + 13 X^{2} Y Z^{3} + 102 X^{2} Y^{2} Z + 2 X^{2} Y Z^{2} + 151 X Y^{3} Z + 26 X Y^{2} Z^{2} + 1572 X Y Z^{3} + 14 X^{2} Y Z + 191 X Y^{2} Z + 265 X Y Z^{2} + 153 X Y Z

Algorithm definition

The algorithm ⟨29×31×32:14705⟩ 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