ON THE ASYMPTOTIC COMPLEXITY OF MATRIX MULTIPLICATION

[1] Bini D., 1980, Calcolo, V17, P87, DOI 10.1007/BF02575865

[2] BINI D, 1978, B7826 I EL INF INT N

[3] Borodin A., 1975, COMPUTATIONAL COMPLE

[4] Hopcroft J., 1973, SIAM Journal on Computing, V2, P159, DOI 10.1137/0202013

[5] LAFON LC, 1979, LOWER BOUND MULTIPLI

[6] Pan V. t. Y., 1972, USPEKHI MATEMATICHES, V27, P249

[7] Pan V. Ya., 1978, 19th Annual Symposium on Foundations of Computer Science, P166, DOI 10.1109/SFCS.1978.34

[8] NEW COMBINATIONS OF METHODS FOR THE ACCELERATION OF MATRIX MULTIPLICATION [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (01) : 73 - 125

[9] PARTIAL AND TOTAL MATRIX MULTIPLICATION [J]. SIAM JOURNAL ON COMPUTING, 1981, 10 (03) : 434 - 455

[10] STRASSEN V, 1973, J REINE ANGEW MATH, V264, P184

[1] Bini D., 1980, Calcolo, V17, P87, DOI 10.1007/BF02575865

[2] BINI D, 1978, B7826 I EL INF INT N

[3] Borodin A., 1975, COMPUTATIONAL COMPLE

[4] Hopcroft J., 1973, SIAM Journal on Computing, V2, P159, DOI 10.1137/0202013

[5] LAFON LC, 1979, LOWER BOUND MULTIPLI

[6] Pan V. t. Y., 1972, USPEKHI MATEMATICHES, V27, P249

[7] Pan V. Ya., 1978, 19th Annual Symposium on Foundations of Computer Science, P166, DOI 10.1109/SFCS.1978.34

[8] NEW COMBINATIONS OF METHODS FOR THE ACCELERATION OF MATRIX MULTIPLICATION [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (01) : 73 - 125

[9] PARTIAL AND TOTAL MATRIX MULTIPLICATION [J]. SIAM JOURNAL ON COMPUTING, 1981, 10 (03) : 434 - 455

[10] STRASSEN V, 1973, J REINE ANGEW MATH, V264, P184