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

Algorithm type

[[1, 1, 1]$143,[1, 1, 2]$246,[1, 1, 3]$1356,[1, 2, 1]$178,[1, 2, 2]$24,[1, 3, 1]$140,[2, 1, 1]$13,[2, 1, 2]$2,[2, 1, 3]$12,[2, 2, 1]$95,[2, 2, 2]$906,[2, 2, 3]$288,[2, 3, 1]$156,[2, 3, 2]$1828,[3, 2, 1]$62,[3, 2, 2]$300,[3, 2, 3]$288,[3, 3, 1]$1306,[3, 3, 3]$4962]

Algorithm definition

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