On the Asymptotic Complexity of Matrix Multiplication
- 1 August 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (3) , 472-492
- https://doi.org/10.1137/0211038
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Partial and Total Matrix MultiplicationSIAM Journal on Computing, 1981
- New combinations of methods for the acceleration of matrix multiplicationsComputers & Mathematics with Applications, 1981
- Relations between exact and approximate bilinear algorithms. ApplicationsCalcolo, 1980
- Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear FormsSIAM Journal on Computing, 1973
- Gaussian elimination is not optimalNumerische Mathematik, 1969