The I/O complexity of Strassen's matrix multiplication with recomputation

Gianfranco Bilardi, Lorenzo De Stefani

A tight $\Omega ((n/\sqrt{M}{)}^{{\log }_{2}7}M)$ lower bound is derived on the \io complexity of Strassen's algorithm to multiply two $n\times n$ matrices, in a two-level storage hierarchy w…