Showing cs.SCShow all
2 papers · 1 filter
cs.SC2016
Parallel Integer Polynomial Multiplication
Changbo Chen, Svyatoslav Covanov, Farnam Mansouri +3
We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and…
cs.SC2015
Fast integer multiplication using generalized Fermat primes
Svyatoslav Covanov, Emmanuel Thomé
For almost 35 years, Sch{ö}nhage-Strassen's algorithm has been the fastest algorithm known for multiplying integers, with a time complexity O(n log n log log n) f…