All Questions
Tagged with computational-geometry semialgebraic-geometry
2 questions
14
votes
2
answers
637
views
Tarski-Seidenberg for strict inequalities and bounded quantification
This theorem says that quantifiers over real variables can be eliminated from classical first order formulae built from equations and inequalities between polynomials with rational coefficients, ie in ...
5
votes
1
answer
169
views
Connectedness of semialgebraic sets via CAD
I do not know whether there is a standard or some traditional ways to decide whether a semialgebraic set is connected or not.
One way I know is the cylindrical algebraic decomposition (CAD) algorithm. ...