Parallel Integer Polynomial Multiplication
Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Marc Moreno Maza,, Ning Xie, Yuzhen Xie
TL;DR
This paper introduces a parallel algorithm for multiplying dense polynomials with integer coefficients, optimized for multi-core processors, and demonstrates its efficiency through theoretical analysis and experimental results.
Contribution
The paper presents a novel parallel algorithm for dense integer polynomial multiplication, improving performance on multi-core architectures.
Findings
Algorithm shows improved speedup on multi-core systems
Complexity estimates validate efficiency gains
Experimental results confirm practical advantages
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Polynomial and algebraic computation · Tensor decomposition and applications