Improved sparse multivariate polynomial interpolation algorithms

88Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the problem of interpolating sparse multivariate polynomials from their values. We discuss two algorithms for sparse interpolation, one due to Ben-Or and Tiwari (1988) and the other due to Zippel (1988). We present efficient algorithms for finding the rank of certain special Toeplitz systems arising in the Ben-Or and Tiwari algorithm and for solving transposed Vandermonde systems of equations, the use of which greatly improves the time complexities of the two interpolation algorithms.

Cite

CITATION STYLE

APA

Kaltofen, E., & Yagati, L. (1989). Improved sparse multivariate polynomial interpolation algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 358 LNCS, pp. 467–474). Springer Verlag. https://doi.org/10.1007/3-540-51084-2_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free