2 citations · 4 across the 6 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
math.AC2002
The height of the mixed sparse resultant
Martin Sombra
We present an upper bound for the height of the mixed sparse resultant, defined as the logarithm of the maximum modulus of its coefficients. We obtain a similar estimate for its Ma…
math.AG2002★ 1 cited
The computational complexity of the Chow form
Gabriela Jeronimo, Teresa Krick, Juan Sabia +1
We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the leng…