#### Filter Results:

#### Publication Year

2015

2016

#### Co-author

#### Key Phrase

#### Publication Venue

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> > 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
- ›