arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0005041math.AG

Polar Varieties and Efficient Real Elimination

B. Bank, M. Giusti, J. Heintz, G. M. Mbakop

英文摘要:

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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑