Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication
- 1 January 1978
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 250-256
- https://doi.org/10.1007/3-540-08921-7_72
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Algebras Having Linear Multiplicative ComplexitiesJournal of the ACM, 1977
- Schnelle Multiplikation von Polynomen ber K rpern der Charakteristik 2Acta Informatica, 1977
- Polynomials with Rational Coefficients Which are Hard to ComputeSIAM Journal on Computing, 1974
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von InterpolationskoeffizientenNumerische Mathematik, 1973
- Berechnung und programm. IActa Informatica, 1972
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970