507 search results - page 7 / 102 » Computing Sparse Multiples of Polynomials |
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider exchange economies where the traders’ preferences are expressed in terms of the extensively used constant elasticity of substitution (CES) utility functions...
CF
2008
ACM
13 years 9 months ago
2008
ACM
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
ASAP
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we propose a reconfigurable hardware accelerator for fixed-point-matrix-vector-multiply/add operations, capable to work on dense and sparse matrices formats. The pr...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...