Title: Faster polynomial multiplication via multipoint Kronecker substitution


Speaker: David Harvey, Courant NYU.    
 
The usual Kronecker substitution method reduces multiplication of polynomials in Z[x] to multiplication in Z
 by substituting x = 2^b for an appropriately chosen b. I will describe some variants of this algorithm that 
replace the single integer multiplication by several smaller integer multiplications, yielding a constant 
speedup for certain ranges of polynomial degree. I will also give performance data for an implementation.