A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A subdivision-based algorithm for the sparse resultant

2000
*
Journal of the ACM
*

Multivariate resultants generalize the Sylvester resultant o f t wo polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all common roots to a problem in linear algebra. We propose a determinantal formula for the sparse resultant of an arbitrary system of n + 1 polynomials in n variables. This resultant generalizes the classical one and has signi cantly lower degree for polynomials that are sparse in the sense that their mixed volume is lower

doi:10.1145/337244.337247
fatcat:z7z4myffu5a65m7jiug7jaeftu