On the algorithmic complexity of associative algebras
- 31 December 1981
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 15 (2), 201-211
- https://doi.org/10.1016/0304-3975(81)90070-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Partial and Total Matrix MultiplicationSIAM Journal on Computing, 1981
- New Fast Algorithms for Matrix OperationsSIAM Journal on Computing, 1980
- O(n2.7799) complexity for n × n approximate matrix multiplicationInformation Processing Letters, 1979
- On varieties of optimal algorithms for the computation of bilinear mappings II. optimal algorithms for 2 × 2-matrix multiplicationTheoretical Computer Science, 1978
- On the optimal evaluation of a set of bilinear formsLinear Algebra and its Applications, 1978
- Algebras Having Linear Multiplicative ComplexitiesJournal of the ACM, 1977
- On multiplication of 2 × 2 matricesLinear Algebra and its Applications, 1971
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- METHODS OF COMPUTING VALUES OF POLYNOMIALSRussian Mathematical Surveys, 1966