1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Gianfranco Bilardi, Lorenzo De Stefani
A tight Ω((n/M)log27M) lower bound is derived on the \io complexity of Strassen's algorithm to multiply two n×n matrices, in a two-level storage hierarchy w…