507 search results - page 10 / 102 » Computing Sparse Multiples of Polynomials |
72
Voted
APPT
2009
Springer
15 years 1 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...
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...
CAP
2010
14 years 4 months ago
2010
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
ACMSE
2006
ACM
15 years 1 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
99
Voted
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...