Access the full text.
Sign up today, get DeepDyve free for 14 days.
Qiao-Long Huang, X. Gao (2017)
Sparse Rational Function Interpolation with Finitely Many Values for the CoefficientsArXiv, abs/1706.00914
A. Cuyt, Wen-shin Lee (2011)
Sparse interpolation of multivariate rational functionsTheor. Comput. Sci., 412
(2002)
Algebra, volume 211 of Graduate Texts in Mathematics
A. Arnold, M. Giesbrecht, Daniel Roche (2014)
Faster sparse multivariate polynomial interpolation of straight-line programsJ. Symb. Comput., 75
M. Javadi, M. Monagan (2010)
Parallel sparse polynomial interpolation over finite fieldsM. Moreno Maza and J.-L. Roch
E. Kaltofen, Zhengfeng Yang (2013)
Sparse multivariate function recovery from values with noise and outlier errors
J. von zur Gathen, J. Gerhard (2013)
Modern computer algebraCambridge University Press
J. van der Hoeven, G. Lecerf (2019)
Sparse polynomial interpolationExploring fast heuristic algorithms over finite fields. Technical Report
Sanchit Garg, É. Schost (2009)
Interpolation of polynomials given by straight-line programsTheor. Comput. Sci., 410
Oris Der, Oeven (2020)
Probably faster multiplication ofsparse polynomials
Grégoire Lecerf (2019)
On the complexity of the Lickteig-Roy subresultant algorithmJ. Symb. Comput., 92
(2020)
The Jolly Writer
R. Zippel (1979)
Probabilistic algorithms for sparse polynomials
Jiaxiong Hu, M. Monagan (2016)
A Fast Parallel Sparse Polynomial GCD AlgorithmProceedings of the ACM on International Symposium on Symbolic and Algebraic Computation
Oris Der, Oeven (2020)
Sparse polynomial interpolation. Exploring fast heuristic algorithms over finite fields
E. Kaltofen, B. Trager (1988)
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
Daniel Roche (2018)
What Can (and Can't) we Do with Sparse Polynomials?Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation
J. Hoeven, Grégoire Lecerf (2015)
Sparse Polynomial Interpolation in PracticeACM Commun. Comput. Algebra, 48
D. Grigoriev, Marek Karpinski, M. Singer (1994)
Computational Complexity of Sparse Rational InterpolationSIAM J. Comput., 23
Jennifer Kleine, M. Monagan, A. Wittkopf (2005)
Algorithms for the non-monic case of the sparse modular GCD algorithmProceedings of the 2005 international symposium on Symbolic and algebraic computation
Phelps Linder, Rodger, Bernard Scholkopf, Alexander Smola (2002)
Modern computer algebraSIGACT News, 33
Seyed Javadi, M. Monagan (2010)
Parallel sparse polynomial interpolation over finite fieldsProceedings of the 4th International Workshop on Parallel and Symbolic Computation
J. Hu, M. Monagan (2021)
A fast parallel sparse polynomial GCD algorithmJ. Symbolic Comput., 105
In this note, we present a variant of a probabilistic algorithm by Cuyt and Lee for the sparse interpolation of multivariate rational functions. We also present an analogous method for the computation of sparse gcds.
ACM Communications in Computer Algebra – Association for Computing Machinery
Published: May 20, 2021
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.