Parallel multiplication and powering of polynomials
- 30 April 1991
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 11 (4) , 307-320
- https://doi.org/10.1016/s0747-7171(08)80108-3
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A fast, low-space algorithm for multiplying dense multivariate polynomialsACM Transactions on Mathematical Software, 1987
- Use of VLSI in algebraic computationPublished by Association for Computing Machinery (ACM) ,1981
- A Family of Algorithms for Powering Sparse PolynomialsSIAM Journal on Computing, 1979
- On computing the discrete Fourier transformMathematics of Computation, 1978
- Practical fast polynomial multiplicationPublished by Association for Computing Machinery (ACM) ,1976
- Sorting X + YCommunications of the ACM, 1975
- Polynomial Multiplication, Powers and Asymptotic Analysis: Some CommentsSIAM Journal on Computing, 1974
- On the Computation of Powers of Sparse PolynomialsStudies in Applied Mathematics, 1974