Parallel Integer Polynomial Multiplication
classification
💻 cs.SC
cs.MS
keywords
integerparalleladvantagesalgorithmapproacharchitecturescoefficientscomparisons
read the original abstract
We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantages of this new approach.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.