In [3] the following polynomial evaluation problem arises. Let A be a sparse polynomial with s terms in Zp[x0,x1,...,xn]. Suppose we seek evaluations of A into t bivariate images in Zp[x0,x1], for some t ≪ s. We do not know a priori the exact number of ...
Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis, and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of these ...
The evaluation of a polynomial at several points is called the problem of multi-point evaluation. Sometimes, the set of evaluation points is fixed and several polynomials need to be evaluated at this set of points. Several efficient ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in
