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.
George E. Collins (Fri,) studied this question.