13 citations · 63 across the 21 of their papers we have counts for
4 papers · 1 filter
Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
Aurélien Greuet, Mohab Safey El Din
Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree and be the set of common complex solut…
A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets
Mohab Safey El Din, Eric Schost
A roadmap for a semi-algebraic set is a curve which has a non-empty and connected intersection with all connected components of . Hence, this kind of object, introduced by C…
Intrinsic complexity estimates in polynomial optimization
Bernd Bank, Marc Giusti, Joos Heintz +1
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using ar…
A probabilistic algorithm to compute the real dimension of a semi-algebraic set
Mohab Safey El Din, Elias Tsigaridas
Let $\RR$ be a real closed field (e.g. the field of real numbers) and $\mathscr{S} \subset \RR^n$ be a semi-algebraic set defined as the set of points in $\RR^n$ satisfying a syste…