Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- 1 September 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 2 (3), 159-173
- https://doi.org/10.1137/0202013
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On Obtaining Upper Bounds on the Complexity of Matrix MultiplicationPublished by Springer Nature ,1972
- Evaluation of Rational FunctionsPublished by Springer Nature ,1972
- Sur le calcul des produits de matricesNumerische Mathematik, 1971
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONSProceedings of the National Academy of Sciences, 1967