On commutativity and approximation
- 31 December 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 28 (1) , 135-150
- https://doi.org/10.1016/0304-3975(83)90068-3
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- O(n2.7799) complexity for n × n approximate matrix multiplicationPublished by Elsevier ,2002
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Partial and Total Matrix MultiplicationSIAM Journal on Computing, 1981
- On the Complexity of Bilinear Forms with CommutativitySIAM Journal on Computing, 1980
- Approximate Solutions for the Bilinear Form Computational ProblemSIAM Journal on Computing, 1980
- Some elementary proofs of lower bounds in complexity theoryLinear Algebra and its Applications, 1978
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statisticsLinear Algebra and its Applications, 1977
- Polynomials with Rational Coefficients Which are Hard to ComputeSIAM Journal on Computing, 1974
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970