Abstract.
Let \(S_0\) be a smooth and compact real variety given by a reduced regular sequence of polynomials \(f_1, \ldots, f_p\). This paper is devoted to the algorithmic problem of finding efficiently a representative point for each connected component of \(S_0\) . For this purpose we exhibit explicit polynomial equations that describe the generic polar varieties of \(S_0\). This leads to a procedure which solves our algorithmic problem in time that is polynomial in the (extrinsic) description length of the input equations \(f_1,\ldots, f_p\) and in a suitably introduced, intrinsic geometric parameter, called the degree of the real interpretation of the given equation system \(f_1,\ldots,f_p\).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: 17 December 1999; in final form: 24 March 2000 / Published online: 4 May 2001
Rights and permissions
About this article
Cite this article
Bank, B., Giusti, M., Heintz, J. et al. Polar varieties and efficient real elimination. Math Z 238, 115–144 (2001). https://doi.org/10.1007/PL00004896
Issue Date:
DOI: https://doi.org/10.1007/PL00004896