Title	Some algorithms for sparse polynomial evaluation
Creator	Schost, Eric
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-11-01T09:30
Description	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.
Extent	54 minutes
Subject	Mathematics; Approximations and expansions; Commutative rings and algebras; Classical analysis
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Waterloo Canada
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2017-06-03
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0348076
URI	http://hdl.handle.net/2429/61826
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos