Description of fast matrix multiplication algorithm: 〈3×5×5:58〉
The algorithm 〈3×5×5:58〉 is taken from:
|Alexandre Sedoglavic and Alexey Vladimirovich Smirnov. The tensor rank of 5×5 matrices multiplication is bounded by 98 and its border rank by 89. Technical Report 2101.12568, arXiv, January 2021.|
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