EFFICIENT ALGORITHMS FOR MULTIPOLYNOMIAL RESULTANT

The multipolynomial resultant of a set of equations is fundamental in quantifier elimination over the elementary theory of real and algebrai cally closed fields. Earlier algorithms for resultant computation and symbolic elimination are considered slow in practice. In this paper we present efficient algorithms to compute multipolynomial resultants an d demonstrates their use for polynomial manipulation and symbolic appl ications. The algorithms utilize the linear algebra formulation of the resultants and combine its multivariate interpolation and modular ari thmetic for fast computation. It is currently being implemented as par t of a package and we discuss its performance as well.