| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438036 | Theoretical Computer Science | 2009 | 4 Pages |
Abstract
We give an algorithm for the interpolation of a polynomial A given by a straight-line program. Its complexity is polynomial in τ,log(d),L,n, where τ is an input bound on the number of terms in A, d is a bound on its partial degree in all variables, L is the length of the given straight-line program and n is the number of variables.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
