Sparse Polynomial Interpolation from zero of the zero polynomial is Watch Video

⏲ Duration: 19 min 0 sec
✓ Published: 18-Jun-2011

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(d&#n)$ 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