Fast Multipoint-Evaluation of Bivariate Polynomials
Michael Nüsken, Martin Ziegler
Abstract
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 n2 coefficients, simultaneously at n2 given points using a total of O(n2.667) arithmetic operations. In terms of the input size N being quadratic in n, this amounts to an amortized cost of O(N0.334) per point.
Create a lesson
Related papers
Settling the Approximability of Submodular Facility Location
Adam N. Elmachtoub, Bento Natura, Meike Neuwohner
Bipartite Matching with Few Rounds of Demand Queries
Shravan Mehra, Sagnik Mukhopadhyay, Vihan Shah
Two Holes Make a Difference: Deterministic Paging with Delay and Deadlines
Darya Melnyk, Linda Thelen, Yuyi Wang
Selecting the 7th Smallest of 16 Elements Takes Exactly 28 Comparisons
Jonathan Cremer
Exploring Minimal Blocking Sets for Kernelization Lower Bounds for F-Minor Deletion
Ahmed Ghazy, Jakob Greilhuber, Tim A. Hartmann
Semi-Streaming Estimation of the Held--Karp Bound and Graph-Metric TSP Cost
Sharareh Alipour