Computer Science – Data Structures and Algorithms
Scientific paper
2004-03-12
Computer Science
Data Structures and Algorithms
12 pages, 1 figure. To appear in Proc. 12th ESA 2004
Scientific paper
We generalize univariate multipoint evaluation of polynomials of degree n at sublinear amortized cost per point. More precisely, it is shown how to evaluate a bivariate polynomial p of maximum degree less than n, specified by its n^2 coefficients, simultaneously at n^2 given points using a total of O(n^{2.667}) arithmetic operations. In terms of the input size N being quadratic in n, this amounts to an amortized cost of O(N^{0.334}) per point.
Nüsken Michael
Ziegler Martin
No associations
LandOfFree
Fast Multipoint-Evaluation of Bivariate Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fast Multipoint-Evaluation of Bivariate Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Multipoint-Evaluation of Bivariate Polynomials will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-161396