Re: speed of multiplying polynomials

*To*: mathgroup at smc.vnet.net*Subject*: [mg72803] Re: speed of multiplying polynomials*From*: "Roman Pearce" <rpearcea at gmail.com>*Date*: Sat, 20 Jan 2007 03:28:44 -0500 (EST)*References*: <200701070439.XAA14676@smc.vnet.net><eol0hb$47r$1@smc.vnet.net>

Roman Pearce wrote: > I bet it is incrementally adding up large numbers. For example, if I > have 1000 numbers c[0], ..., c[999], and those numbers are big, then > the obvious algorithm (in C): > > for(i=0, sum=0; i < 1000; i++) > sum += c[i]; > > is a disaster. Sorry, this is nonsense. I was confusing addition with multiplication.

**References**:**speed of multiplying polynomials***From:*dmharvey@math.harvard.edu