On memory requirements of Strassen's algorithms

1. Bunch J., Hopcroft J.E., Triangular factorization and inversion by fast matrix multiplication, Math. Comp. 28, 1974, 231–236

   Google Scholar 

2. Fiduccia C.M., Fast matrix multiplication, Proc. 3rd Annual ACM Symposium on Theory of Computing, 1971, 45–49

   Google Scholar 

3. Fiduccia C.M., On obtaining upper bounds on the complexity of matrix multiplication, in Complexity of Computer Computations, N.Y.-London, 1972, 31–40

   Google Scholar 

4. Fischer P.C., Probert R.L., Efficient procedures for using matrix algorithms, Proc. 2nd Coll.Aut.Lan.Prog., 1974, 413–427

   Google Scholar 

5. Fischer P.C., Further schemes for combining matrix algorithms, Proc. 2nd Coll.Aut.Lan.Prog., 1974, 428–436

   Google Scholar 

6. Hopcroft J.E., Kerr L.R., On minimizing the number of multiplications necessary for matrix multiplication, SIAM J.Ap.Math., 20, 1971, 30–36

   Article  Google Scholar 

7. Hopcroft J.E., Musinski J., Duality in determining the complexity of noncommutative matrix multiplication, Proc. 5th Annual ACM Symposium on Theory of Computing, 1973, 73–87

   Google Scholar 

8. Kerr L.R., The effect of algebraic structure on the computational complexity of matrix multiplications, Ph.D. Thesis, Cornell Un.

   Google Scholar 

9. Strassen V., Gaussian elimination is not optimal, Num.Math. 13, 1969 354–356

   Google Scholar 

10. Winograd S., On the multiplication of 2×2 matrices, Linear Algebra and its applications, 4, 1971, 381–388

    Article  Google Scholar 

Download references