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.
['Alin Bostan', 'Philippe Flajolet', 'Bruno Salvy', 'Éric Schost']
Fast computation of special resultants