Sciweavers

ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
14 years 7 months ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce