Interpolating Polynomials from Their Values

Zippel, Richard

dc.contributor.author	Zippel, Richard	en_US
dc.date.accessioned	2007-04-23T17:41:25Z
dc.date.available	2007-04-23T17:41:25Z
dc.date.issued	1989-01	en_US
dc.identifier.citation	http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-963	en_US
dc.identifier.uri	https://hdl.handle.net/1813/6879
dc.description.abstract	A fundamental technique used by many algorithms in computer algebra is interpolating polynomials from their values. This paper discusses two algorithms for solving this problem for sparse multivariate polynomials, an updated version of a probabilistic one and a new deterministic technique that uses some ideas due to Ben-Or and Tiwari (1988). In addition, algorithms are presented for quickly finding points that are not zeroes of sparse multivariate polynomials - the zero avoidance problem.	en_US
dc.format.extent	2810064 bytes
dc.format.extent	611578 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.language.iso	en_US	en_US
dc.publisher	Cornell University	en_US
dc.subject	computer science	en_US
dc.subject	technical report	en_US
dc.title	Interpolating Polynomials from Their Values	en_US
dc.type	technical report	en_US