Efficient incremental algorithms for the sparse resultant and the mixed volume

A new and efficient algorithm for computing the sparse resultant of a system of n + 1 polynomial equations in n unknowns that produces a matrix whose entries are coefficients of the given polynomials and is typically smaller than the matrices obtained by previous approaches.