On the Complexity of Bilinear Forms with Commutativity
- 1 November 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (4) , 713-728
- https://doi.org/10.1137/0209056
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Optimal Evaluation of Pairs of Bilinear FormsSIAM Journal on Computing, 1979
- On varieties of optimal algorithms for the computation of bilinear mappings I. the isotropy group of a bilinear mappingTheoretical Computer Science, 1978
- Some elementary proofs of lower bounds in complexity theoryLinear Algebra and its Applications, 1978
- 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
- Optimum computation of p bilinear formsLinear Algebra and its Applications, 1975
- On The Complexity Of Symmetric Computations*INFOR: Information Systems and Operational Research, 1974
- 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
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971