On fast multiplication of polynomials over arbitrary algebras
- 1 July 1991
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 28 (7), 693-701
- https://doi.org/10.1007/bf01178683
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- On arithmetical algorithms over finite fieldsJournal of Combinatorial Theory, Series A, 1989
- Algebraic complexities and algebraic curves over finite fieldsJournal of Complexity, 1988
- An algorithm for polynomial multiplication that does not depend on the ring constantsJournal of Algorithms, 1988
- Greatest common divisors of polynomials given by straight-line programsJournal of the ACM, 1988
- On the complexity of multiplication in finite fieldsTheoretical Computer Science, 1983
- Fast polynomial transform algorithms for digital convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplicationLecture Notes in Computer Science, 1978
- Schnelle Multiplikation von Polynomen ber K rpern der Charakteristik 2Acta Informatica, 1977
- Schnelle Multiplikation großer ZahlenComputing, 1971
- Resultants of cyclotomic polynomialsProceedings of the American Mathematical Society, 1970