An algorithm for polynomial multiplication that does not depend on the ring constants
From MaRDI portal
Publication:3792774
DOI10.1016/0196-6774(88)90010-7zbMath0648.13001MaRDI QIDQ3792774
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
68W30: Symbolic computation and algebraic computation
13-04: Software, source code, etc. for problems pertaining to commutative algebra
13B25: Polynomials over commutative rings
Related Items
On fast multiplication of polynomials over arbitrary algebras, Faster Polynomial Multiplication via Discrete Fourier Transforms, MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING