Optimal Evaluation of Pairs of Bilinear Forms
- 1 August 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (3) , 443-462
- https://doi.org/10.1137/0208037
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the maximal multiplicative complexity of a family of bilinear formsLinear Algebra and its Applications, 1979
- On the optimal evaluation of a set of bilinear formsLinear Algebra and its Applications, 1978
- On the Number of Multiplications Required for Matrix MultiplicationSIAM Journal on Computing, 1976
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplicationsBulletin of the American Mathematical Society, 1976
- Optimum computation of p bilinear formsLinear Algebra and its Applications, 1975
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear FormsSIAM Journal on Computing, 1973
- On Obtaining Upper Bounds on the Complexity of Matrix MultiplicationPublished 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