507 search results - page 6 / 102 » Computing Sparse Multiples of Polynomials |
220
click to vote
ARITH
2009
IEEE
16 years 18 days ago
2009
IEEE
A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation a...
146
Voted
ITA
2002
15 years 5 months ago
2002
Abstract. Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers and respectively, such that and are multiplicatively...
168
click to vote
ICCS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
145
Voted
PDCAT
2009
Springer
16 years 10 days ago
2009
Springer
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...