Point searching in real singular complete intersection varieties-algorithms of intrinsic complexity

摘要

@@ Let Q, R and C be the fields of rational, real and complex numbers, respectively, let X :=(X1,...,Xn) be a vector of indeterminates over C and let F1,..., Fp be a regular sequence of polynomials in Q[X] denning a closed, Qdefinable subvariety S of the n-dimensional complex afnne space An :=Cn. Thus S is a non-empty equidimensional afnne variety of dimension n -p, I.e., each irreducible component of S is of dimension n -p.