| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401553 | Journal of Symbolic Computation | 2006 | 29 Pages |
Abstract
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multivariate resultants, that we compute using power sums of roots of polynomials, by means of their generating series.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
