An algorithm for polynomial multiplication that does not depend on the ring constants
- 1 March 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (1), 137-147
- https://doi.org/10.1016/0196-6774(88)90010-7
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Cyclotomic polynomials and units in cyclotomic number fieldsJournal of Number Theory, 1988
- On the complexity of multiplication in finite fieldsTheoretical Computer Science, 1983
- An Improved Lower Bound on Polynomial MultiplicationIEEE Transactions on Computers, 1980
- Fast polynomial transform algorithms for digital convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- Algebras Having Linear Multiplicative ComplexitiesJournal of the ACM, 1977
- Schnelle Multiplikation von Polynomen ber K rpern der Charakteristik 2Acta Informatica, 1977
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976
- The distribution of values of the Euler functionActa Arithmetica, 1972