Description of fast matrix multiplication algorithm: ⟨23×23×23:6724⟩

Algorithm type

[[1, 1, 1]$90,[1, 1, 2]$131,[1, 1, 3]$880,[1, 2, 1]$25,[1, 2, 2]$10,[1, 3, 1]$21,[2, 1, 1]$35,[2, 1, 2]$22,[2, 1, 3]$10,[2, 2, 1]$79,[2, 2, 2]$344,[2, 2, 3]$190,[2, 3, 1]$63,[2, 3, 2]$610,[3, 1, 1]$10,[3, 1, 2]$220,[3, 2, 1]$74,[3, 2, 2]$410,[3, 2, 3]$200,[3, 3, 1]$840,[3, 3, 3]$2460]

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