An algorithm for polynomial multiplication that does not depend on the ring constants

DOI10.1016/0196-6774(88)90010-7zbMath0648.13001OpenAlexW2012990935MaRDI QIDQ3792774

Michael Kaminski

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90010-7

zbMATH Keywords

Chinese Remainder Theoremalgorithm to multiply two polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomials over commutative rings (13B25)

Related Items

On fast multiplication of polynomials over arbitrary algebras ⋮ Faster Polynomial Multiplication via Discrete Fourier Transforms ⋮ MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING