Marshall Law

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We present a parallel implementation in Cilk C of a modular algorithm for multiplying two polynomials in <i>Z</i><sub><i>q</i></sub>[<i>x</i>] for integer <i>q</i> &gt; 1, for multi-core computers. Our algorithm uses Chinese remaindering. It multiplies modulo primes <i>p</i><sub>1</sub>, <i>p</i><sub>2</sub>, ... in parallel and uses a parallel FFT for each(More)
  • 1