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

Algorithm type

5551 X^{3} Y^{3} Z^{3} + 325 X^{3} Y^{2} Z^{3} + 1407 X^{3} Y^{3} Z + 338 X^{3} Y^{2} Z^{2} + 1326 X^{2} Y^{3} Z^{2} + 325 X^{2} Y^{2} Z^{3} + 66 X^{3} Y^{2} Z + 108 X^{2} Y^{3} Z + 889 X^{2} Y^{2} Z^{2} + 13 X^{2} Y Z^{3} + 85 X^{2} Y^{2} Z + X^{2} Y Z^{2} + 53 X Y^{3} Z + 13 X Y^{2} Z^{2} + 1460 X Y Z^{3} + 14 X^{2} Y Z + 111 X Y^{2} Z + 203 X Y Z^{2} + 145 X Y Z

Algorithm definition

The algorithm ⟨28×29×30:12433⟩ 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