2 search results - page 1 / 1 » Finding at Least One Point in Each Connected Component of a ... |
JC
2000
13 years 5 months ago
2000
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
CORR
2008
Springer
13 years 5 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...