Modular rational sparse multivariate polynomial interpolation

Authors:
E. Kaltofen;Y. N. Lakshman;J.-M. Wiley
Affiliations:
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York;Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York;Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York
Venue:
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Year:
1990

Citing 6
Cited 14

A deterministic algorithm for sparse multivariate polynomial interpolation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Interpolating polynomials from their values

Journal of Symbolic Computation - Special issue on computational algebraic complexity
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)
Improved Sparse Multivariate Polynomial Interpolation Algorithms

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
P-adic reconstruction of rational numbers

ACM SIGSAM Bulletin

Efficient techniques for multipolynomial resultant algorithms

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
DSC: a system for distributed symbolic computation

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
On computing greatest common divisors with polynomials given by black boxes for their evaluations

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters

ACM SIGSAM Bulletin
Early termination in sparse interpolation algorithms

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Interpolation of polynomials given by straight-line programs

Theoretical Computer Science
Parallel sparse polynomial interpolation over finite fields

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Applications of FFT and structured matrices

Algorithms and theory of computation handbook
Diversification improves interpolation

Proceedings of the 36th international symposium on Symbolic and algebraic computation
New Techniques for the Computation of Linear Recurrence Coefficients

Finite Fields and Their Applications
On the bit-complexity of sparse polynomial and series multiplication

Journal of Symbolic Computation
Structured FFT and TFT: symmetric and lattice polynomials

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of interpolating multivariate polynomials whose coefficient domain is the rational numbers is considered. The effect of intermediate number growth on a speeded Ben-Or and Tiwari algorithm is studied.Then the newly developed modular algorithm is presented. The computing times for the speeded Ben-Or and Tiwari and the modular algorithm are compared, and it is shown that the modular algorithm is markedly superior.