67 search results - page 2 / 14 » Parallel sparse polynomial multiplication using heaps |
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
CAP
2010
13 years 6 days ago
2010
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
IAJIT
2011
13 years 5 days ago
2011
: The present paper discusses the implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a PC-Cluste...
JACM
2000
13 years 5 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
ICPPW
2009
IEEE
13 years 12 months ago
2009
IEEE
—In this paper, we investigate the differences and tradeoffs imposed by two parallel Haskell dialects running on multicore machines. GpH and Eden are both constructed using the h...