
Evaluating sparse polynomials at many points.Michael Monagan, CECMWednesday May 11th at 1:30pm in K9509.
Abstract Let A(x_{1},x_{2},...,x_{n}) be a sparse polynomial over a prime field with S nonzero terms. Given a point (a_{1},a_{2},...,a_{n}), how fast can we compute the T values A(a_{1}^{k},a_{2}^{k},...,a_{n}^{k}) for k=1,2,...,T? This evaluation problem arises in multivariate polynomial GCD computation. We present three methods. 