English

Parallel Integer Polynomial Multiplication

Symbolic Computation 2016-12-20 v1 Mathematical Software

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.

Keywords

Cite

@article{arxiv.1612.05778,
  title  = {Parallel Integer Polynomial Multiplication},
  author = {Changbo Chen and Svyatoslav Covanov and Farnam Mansouri and Marc Moreno Maza and Ning Xie and Yuzhen Xie},
  journal= {arXiv preprint arXiv:1612.05778},
  year   = {2016}
}