Description of fast matrix multiplication algorithm:

Algorithm type

$\mathrm{TypePolynomialRepresentation}\left(\mathrm{ReturnFastMatrixMultiplication}\left(\left[5,27,31\right]\right),\left[X,Y,Z\right]\right)$

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