Efficient algorithm computes resultants of multivariate polynomials, suggesting improved calculations in algebraic fields.
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.
No takes yet. Share an insight, caveat, or question.
George E. Collins (1971) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: