Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
From MaRDI portal
Publication:3454763
DOI10.1145/345542.345629zbMATH Open1326.68358OpenAlexW2076309556MaRDI QIDQ3454763FDOQ3454763
Authors: Erich L. Kaltofen, Wen-shin Lee, Austin A. Lobo 
Publication date: 26 November 2015
Published in: Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/345542.345629
Cited In (15)
- On efficient sparse integer matrix Smith normal form computations
- Reconstructing rational functions with \texttt{FireFly}
- A fast parallel sparse polynomial GCD algorithm
- Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly}
- Balancing act: multivariate rational reconstruction for IBP
- Early termination in sparse interpolation algorithms
- Integration-by-parts reductions of Feynman integrals using singular and GPI-space
- A new algorithm for sparse interpolation of multivariate polynomials
- Sparse interpolation of multivariate rational functions
- Faint and clustered components in exponential analysis
- Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
- Solving Parametric Linear Systems Using Sparse Rational Function Interpolation
- Resultant elimination via implicit equation interpolation
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- Sparse interpolation in terms of multivariate Chebyshev polynomials
Uses Software
This page was built for publication: Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454763)
