Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

JSC
2006

favoriteEmaildiscussreport

76views more JSC 2006»

Fast computation of special resultants

13 years 11 months ago

Fast computation of special resultants

Download www.csd.uwo.ca

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, &Eacu

Real-time Traffic

JSC 2006 | Power Sums | Sums | Univariate Polynomials |

claim paper

Related Content

» Order estimation for a special class of hidden Markov sources and binary renewal processes

» The use of subvector quantization and discrete densities for fast GMM computation for spea...

» PRjoin a nonblocking join achieving higher early result rate with statistical guarantees

» Fast Optimized Sun RPC Using Automatic Program Specialization

» Fast Algorithms for Logconcave Functions Sampling Rounding Integration and Optimization

» Tampering with Special Purpose Trusted Computing Devices A Case Study in Optical Scan EVot...

» Privacypreserving genomic computation through program specialization

» Implementing Bitaddressing with Specialization

» A Comprehensive Scheduler for Asymmetric Multicore Systems

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JSC
Authors	Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost

Comments (0)