BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

Some algorithms for sparse polynomial evaluation Schost, Eric


While there exists a growing literature dealing with the interpolation of sparse polynomials, fewer references address problems related to the evaluation of such polynomials. A notable exception is a result by Canny, Kaltofen and Lakshman, which shows that this can be done in amortized polylogarithmic time, provided we use very specific evaluation points. In this talk, I will discuss some questions around the evaluation of sparse polynomials for general evaluation points. This is joint work with Dorian Nogneng and Larry Li.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International