89 citations · 407 across the 45 of their papers we have counts for
5 papers · 1 filter
Bit complexity for computing one point in each connected component of a smooth real algebraic set
Jesse Elliott, Mark Giesbrecht, Eric Schost
We analyze the bit complexity of an algorithm for the computation of at least one point in each connected component of a smooth real algebraic set. This work is a continuation of o…
Connectivity in Semi-Algebraic Sets I
Hoon Hong, James Rohal, Mohab Safey El Din +1
A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected com…
Algebraic Construction of Quasi-split Algebraic Tori
Armin Jamshidpey, Nicole Lemire, Eric Schost
The main purpose of this work is to give a constructive proof for a particular case of the no-name lemma. Let be a finite group, be a field, be a permutation -lattic…
A baby step-giant step roadmap algorithm for general algebraic sets
Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din +1
Let be a real closed field and an ordered domain. We give an algorithm that takes as input a polynomial $Q \in \mathrm{D}[X_1,\ldots,X_…
On the geometry of polar varieties
B. Bank, M. Giusti, J. Heintz +2
We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehens…