Sparse Polynomial Interpolation from zero of the zero polynomial Watch Video
Preview(s):
Gallery
Play Video: (Note: The default playback of the video is HD VERSION. If your browser is buffering the video slowly, please play the REGULAR MP4 VERSION or Open The Video below for better experience. Thank you!)
Description: Speaker:Monagan, MichaelnAffiliation:Simon Fraser UniversitynnAbstractnnnWe consider the problem of interpolating a sparse multivariate polynomialn$f(x_1,x_2,...,x_n)$ of degree $d$ with $t$ non-zero terms over a ring.nNewton interpolation needs $O(dn)$ points to interpolate $f$ which isnexponential in $n$.Our goal is an algorithm whose time complexitynis polynomial in $d$, $n$ and $t$.Our motivation is polynomial GCD computation.nHere one normally works modulo a prime $p$ and hence int
Play Video: (Note: The default playback of the video is HD VERSION. If your browser is buffering the video slowly, please play the REGULAR MP4 VERSION or Open The Video below for better experience. Thank you!)