3 search results - page 1 / 1 » An asymptotically tight bound on the number of connected com... |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...