67 search results - page 3 / 14 » Parallel sparse polynomial multiplication using heaps |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
CMA
2010
13 years 4 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
ICPP
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth re...
APPT
2009
Springer
13 years 11 months ago
2009
Springer
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...
WCE
2007
13 years 8 months ago
2007
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...