Approximate Solutions for the Bilinear Form Computational Problem
- 1 November 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (4) , 692-697
- https://doi.org/10.1137/0209053
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- O(n2.7799) complexity for n × n approximate matrix multiplicationPublished by Elsevier ,2002
- Relations between exact and approximate bilinear algorithms. ApplicationsCalcolo, 1980
- Complexity measures for matrix multiplication algorithmsCalcolo, 1980
- 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