Rational Univariate Reduction via toric resultants
We describe algorithms for solving a given System of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We Compute the RUR from the toric resultant of the input System. Our algorithms derandomize several of the choices made in similar prior algorithms. We also propose a new derandomized algorithm for solving an overdetermined system. Finally, we analyze the computational complexity of the algorithm, and discuss its implementation and performance. (C) 2008 Elsevier Ltd. All rights reserved.
polynomial system solving rational univariate representation geometric resolution toric (or sparse) resultant