Description of fast matrix multiplication algorithm: ⟨23×23×24:6852⟩

Algorithm type

[[1, 1, 1]$95,[1, 1, 2]$107,[1, 1, 3]$949,[1, 2, 1]$24,[1, 2, 2]$11,[1, 3, 1]$20,[2, 1, 1]$2,[2, 1, 2]$25,[2, 1, 3]$20,[2, 2, 1]$100,[2, 2, 2]$374,[2, 2, 3]$211,[2, 3, 1]$63,[2, 3, 2]$591,[3, 1, 2]$10,[3, 2, 1]$63,[3, 2, 2]$221,[3, 2, 3]$380,[3, 3, 1]$886,[3, 3, 3]$2700]

Algorithm definition

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