Description of fast matrix multiplication algorithm: ⟨25×27×28:10177⟩

Algorithm type

[[1, 1, 1]$133,[1, 1, 2]$227,[1, 1, 3]$1156,[1, 2, 1]$165,[1, 2, 2]$22,[1, 3, 1]$129,[2, 1, 1]$12,[2, 1, 2]$2,[2, 1, 3]$11,[2, 2, 1]$88,[2, 2, 2]$788,[2, 2, 3]$242,[2, 3, 1]$144,[2, 3, 2]$1544,[3, 2, 1]$57,[3, 2, 2]$253,[3, 2, 3]$242,[3, 3, 1]$1110,[3, 3, 3]$3852]

Algorithm definition

The algorithm ⟨25×27×28:10177⟩ 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