Interpolation of polynomials given by straight-line programs

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-li...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 410; no. 27; pp. 2659 - 2662
Main Authors:	Garg, Sanchit, Schost, Éric
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 28-06-2009 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximations and expansions Computer science; control theory; systems Exact sciences and technology Interpolation Mathematical analysis Mathematics Miscellaneous Numerical analysis Numerical analysis. Scientific computation Numerical approximation Sciences and techniques of general use Straight-line program Theoretical computing Interpolation Straight-line program Polynomial Input Computer theory Polynomial interpolation Algorithm Complexity
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0304-3975 1879-2294
DOI:	10.1016/j.tcs.2009.03.030