The complexity of vector-products
- 31 March 1976
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 4 (6) , 149-154
- https://doi.org/10.1016/0020-0190(76)90084-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the complexity of quaternion multiplicationInformation Processing Letters, 1975
- Optimum computation of p bilinear formsLinear Algebra and its Applications, 1975
- On Obtaining Upper Bounds on the Complexity of Matrix MultiplicationPublished by Springer Nature ,1972
- On multiplication of 2 × 2 matricesLinear Algebra and its Applications, 1971
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970