Publication Details
Title: Computational Complexity of Sparse Rational Interpolation
Author: D. Grigoriev, M. Karpinski, and M. F. Singer
Group: ICSI Technical Reports
Date: March 1991
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1991/tr-91-018.pdf
Overview:
We analyze the computational complexity of sparse rational interpolation, and give the first genuine time (arithmetic complexity does not depend on the size of the coefficients) algorithm for this problem.
Author: D. Grigoriev, M. Karpinski, and M. F. Singer
Group: ICSI Technical Reports
Date: March 1991
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1991/tr-91-018.pdf
Overview:
We analyze the computational complexity of sparse rational interpolation, and give the first genuine time (arithmetic complexity does not depend on the size of the coefficients) algorithm for this problem.
Keywords: Computational Complexity, Algorithms, Arithmetic Complexity, Sparse Rational Interpolation.
Bibliographic Information:
ICSI Technical Report TR-91-018
Bibliographic Reference:
D. Grigoriev, M. Karpinski, and M. F. Singer. Computational Complexity of Sparse Rational Interpolation. ICSI Technical Report TR-91-018, March 1991