Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies
Abstract
In~1969, V. Strassen improves theclassical~2x2 matrix multiplication algorithm. The
current upper bound for~3x3 matrix multiplication was
reached by J.B.\ Laderman in 1976.
This note presents a geometric relationship between Strassen and
Laderman algorithms.
Domains
Symbolic Computation [cs.SC]
Origin : Files produced by the author(s)