In this paper, a new algorithm for performing quantifier elimination from first order formulas
over real closed fields in given. This algorithm improves the complexity of the asymptotically …

Let f1, ldots, fs be polynomials in Q [X1,..., Xn] that generate a radical ideal and let V be their
complex zero-set. Suppose that V is smooth and equidimensional; then we show that …

We want to propose alternative computational methods for dealing with the following three
classical problems in the study of zero-dimensional systems, rephrased in the context of …

Das Vergleichen zweier geometrischer Formen ist eine Aufgabe, die aus vielerlei
Anwendungen natürlich hervorgeht. Einige Anwendungen sind Computer Vision, Computer …

We give a linear-time algorithm for single-source shortest paths in planar graphs with
nonnegative edgelengths. Our algorithm also yields a linear-time algorithm for maximum …

We revisit Hopcroft's problem and related fundamental problems about geometric range
searching. Given n points and n lines in the plane, we show how to count the number of …

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 …

We study the problem of allocating divisible bads (chores) among multiple agents with
additive utilities when monetary transfers are not allowed. The competitive rule is known for …

We study the problem of allocating divisible bads (chores) among multiple agents with
additive utilities when monetary transfers are not allowed. The competitive rule is known for …

Finding one point on each semi-algebraically connected component of a real algebraic
variety, or at least deciding if such a variety is empty or not, is a fundamental problem of …