507 search results - page 6 / 102 » Computing Sparse Multiples of Polynomials |
ARITH
2009
IEEE
14 years 2 months 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...
ITA
2002
13 years 7 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...
ICCS
2001
Springer
14 years 3 days 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...
ARITH
2007
IEEE
14 years 2 months ago
2007
IEEE
PDCAT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...