2000 character limit reached
Parallel Integer Polynomial Multiplication
Published 17 Dec 2016 in cs.SC and cs.MS | (1612.05778v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.