Polar Varieties and Efficient Real Elimination
| dc.creator | Bank, B. | |
| dc.creator | Giusti, M. | |
| dc.creator | Heintz, J. | |
| dc.creator | Mbakop, G. M. | |
| dc.date | 2000-05-04 | |
| dc.date.accessioned | 2026-07-07T04:34:59Z | |
| dc.date.available | 2026-07-07T04:34:59Z | |
| dc.description | Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\em 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, >..., f_p$ and in a suitably introduced, intrinsic geometric parameter, called the {\em degree} of the real interpretation of the given equation system $f_1, >..., f_p$. | |
| dc.description | 32 pages | |
| dc.identifier | https://arxiv.org/abs/math/0005041 | |
| dc.identifier | http://arxiv.org/abs/math/0005041 | |
| dc.identifier | MSRI Preprint N0. 1999-056 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/59121 | |
| dc.subject | Algebraic Geometry | |
| dc.subject | 14P05, 14B05, 68W30 | |
| dc.title | Polar Varieties and Efficient Real Elimination | |
| dc.type | text |