Parallel Integer Polynomial Multiplication
Published in arXiv (Cornell University) • Dec 17, 2016
NobleIDNI8P12W57R87S20
Authors:,,
Changbo Chen
Svyatoslav Covanov
Farnam Mansouri
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.
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!