Interpolating polynomials from their values
Open Access
- 31 March 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 9 (3) , 375-403
- https://doi.org/10.1016/s0747-7171(08)80018-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Factoring sparse multivariate polynomialsJournal of Computer and System Sciences, 1985
- Irreducibility of multivariate polynomialsJournal of Computer and System Sciences, 1985
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial FactorizationSIAM Journal on Computing, 1985
- Absolute primality of polynomials is decidable in random polynomial time in the number of variablesPublished by Springer Nature ,1981
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Probabilistic algorithms for sparse polynomialsPublished by Springer Nature ,1979
- An improved multivariate polynomial factoring algorithmMathematics of Computation, 1978
- Factoring multivariate polynomials over the integersMathematics of Computation, 1975
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- Approximate formulas for some functions of prime numbersIllinois Journal of Mathematics, 1962