On the computational complexity of polynomials and bilinear mappings. A survey
Author:
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 269-300
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- On a class of primary algebras of minimal rankLinear Algebra and its Applications, 1985
- The complexity of partial derivativesTheoretical Computer Science, 1983
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- On systems of bilinear forms whose minimal division-free algorithms are all bilinearJournal of Algorithms, 1981
- On the algorithmic complexity of associative algebrasTheoretical Computer Science, 1981
- Some polynomials that are hard to computeTheoretical Computer Science, 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 varieties of optimal algorithms for the computation of bilinear mappings I. the isotropy group of a bilinear mappingTheoretical Computer Science, 1978
- Algebras Having Linear Multiplicative ComplexitiesJournal of the ACM, 1977