A deterministic algorithm for sparse multivariate polynomial interpolation

Michacl Ben-Or, Prasoon Tiwari

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

258 Scopus citations

Abstract

An efficient deterministic polynomial time algorithm is developed for the sparse polynomial interpolation problem. The number of evaluations needed by this algorithm is very small. The algorithm also has a simple NC implementation.

Original languageAmerican English
Title of host publicationProceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988
PublisherAssociation for Computing Machinery
Pages301-309
Number of pages9
ISBN (Print)0897912640, 9780897912648
DOIs
StatePublished - 1988
Event20th Annual ACM Symposium on Theory of Computing, STOC 1988 - Chicago, IL, United States
Duration: 2 May 19884 May 1988

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference20th Annual ACM Symposium on Theory of Computing, STOC 1988
Country/TerritoryUnited States
CityChicago, IL
Period2/05/884/05/88

Fingerprint

Dive into the research topics of 'A deterministic algorithm for sparse multivariate polynomial interpolation'. Together they form a unique fingerprint.

Cite this