Parallel Integer Polynomial Multiplication

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 advantage of this new approach.
Liste complète des métadonnées

Cited literature [34 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01520021
Contributor : Svyatoslav Covanov <>
Submitted on : Tuesday, May 9, 2017 - 4:53:32 PM
Last modification on : Thursday, February 7, 2019 - 4:46:48 PM
Document(s) archivé(s) le : Thursday, August 10, 2017 - 1:32:56 PM

File

ccmmxx-2016.IEEE.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Marc Moreno Maza, Ning Xie, et al.. Parallel Integer Polynomial Multiplication. SYNASC 2016 - 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2016, Timisoara, Romania. pp.72 - 80, ⟨10.1109/SYNASC.2016.024⟩. ⟨hal-01520021⟩

Share

Metrics

Record views

351

Files downloads

207