Journal of the ACM · 1971 · 241 citations · 14 references
Chinese Remainder TheoremSchubert CalculusMultivariate PolynomialsComputational Number TheoryAlgebraic MethodComputer AlgebraExact CalculationMultivariate Polynomial Resultants
An efficient algorithm is presented for the exact calculation of resultants of multivariate polynomials with integer coefficients. The algorithm applies modular homomorphisms and the Chinese remainder theorem, evaluation homomorphisms and interpolation, in reducing the problem to resultant calculation for univariate polynomials over GF(p), whereupon a polynomial remainder sequence algorithm is used.
14
Subresultants and Reduced Polynomial Remainder Sequences
George E. Collins · Journal of the ACM · 1967 · 328 citations
On Euclid's Algorithm and the Theory of Subresultants
Warren S. Brown, J. F. Traub · Journal of the ACM · 1971 · 256 citations · Full text
Numerical Solution of Initial Value Problems
Thomas E. Hull, F. Ceschino, Jean Küntzmann et al. · Mathematics of Computation · 1967 · 97 citations