Construction of roadmaps in semi-algebraic sets
From MaRDI portal
Publication:1311619
DOI10.1007/BF01200148zbMath0807.14047MaRDI QIDQ1311619
Jean-Jacques Risler, L. Gournay
Publication date: 5 March 1995
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
14Q05: Computational aspects of algebraic curves
14P10: Semialgebraic sets and related spaces
Related Items
Computing roadmaps of semi-algebraic sets on a variety, A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface, Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time, Computing the first Betti number of a semi-algebraic set, Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials, Description of the connected components of a semialgebraic set in single exponential time, Algorithms to compute the topology of orientable real algebraic surfaces, Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem, Computing the first few Betti numbers of semi-algebraic sets in single exponential time
Cites Work
- Definability and fast quantifier elimination in algebraically closed fields
- Generalised characteristic polynomials
- Solving systems of polynomial inequalities in subexponential time
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- Complexity of deciding Tarski algebra
- On the Betti Numbers of Real Varieties
- Finding connected components of a semialgebraic set in subexponential time
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
