So in case you're feeling disappointed that we went through all this work and this sort of seemingly clever divide and conquer approach for matrix multiplication, and, and came out at the end no better than the interactive algorithm. Well, there's really no reason to despair, cause remember...
A tensor product formulation of Strassen’s matrix multiplication algorithm with memory reduction - Kumar, Huang, et al. - 1993 () Citation Context ...o flops per word of data transferred and the value of c in (8) is 1 2 . With this definition of c, we can rewrite the lower bound ...