Fast parallel multi-point evaluation of sparse polynomials

Abstract

In [3] the following polynomial evaluation problem arises. Let A be a sparse polynomial with s terms in Z^p[x⁰,x¹,...,xⁿ]. Suppose we seek evaluations of A into t bivariate images in Z^p[x⁰,x¹], for some t ≪ s. We do not know a priori the exact number of images t needed. This will be determined by using a trial value T for t, and increasing T as required.