A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Complexity of the resolution of parametric systems of polynomial equations and inequations
2006
Proceedings of the 2006 international symposium on Symbolic and algebraic computation - ISSAC '06
Consider a parametric system of n polynomial equations and r polynomial inequations in n unknowns and s parameters, with rational coefficients. A recurrent problem is to determine some open set in the parameter space where the considered parametric system admits a constant number of real solutions. Following the works of Lazard and Rouillier, this can be done by the computation of a discriminant variety. Let d bound the degree of the input's polynomials, and σ bound the bit-size of their
doi:10.1145/1145768.1145810
dblp:conf/issac/Moroz06
fatcat:ezstzomiunddvf7nhkcxprrajm