Improved sparse multivariate polynomial interpolation algorithms
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 467-474
- https://doi.org/10.1007/3-540-51084-2_44
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Fast solution of toeplitz systems of equations and computation of Padé approximantsPublished by Elsevier ,2004
- Solving systems of nonlinear polynomial equations fasterPublished by Association for Computing Machinery (ACM) ,1989
- A deterministic algorithm for sparse multivariate polynomial interpolationPublished by Association for Computing Machinery (ACM) ,1988
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominatorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- The matching problem for bipartite graphs with polynomially bounded permanents is in NCPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Computing Rational Zeros of Integral Polynomials by p-Adic ExpansionSIAM Journal on Computing, 1983
- Probabilistic algorithms for sparse polynomialsPublished by Springer Nature ,1979
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- Schnelle Multiplikation großer ZahlenComputing, 1971