Description of the connected components of a semialgebraic set in single exponential time
- 1 January 1994
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 11 (2), 121-140
- https://doi.org/10.1007/bf02573999
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Construction of roadmaps in semi-algebraic setsApplicable Algebra in Engineering, Communication and Computing, 1993
- Counting connected components of a semialgebraic set in subexponential timecomputational complexity, 1992
- Finding connected components of a semialgebraic set in subexponential timeApplicable Algebra in Engineering, Communication and Computing, 1992
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- Single exponential path finding in semialgebraic sets Part I: The case of a regular bounded hypersurfaceLecture Notes in Computer Science, 1991
- Complexity of deciding Tarski algebraJournal of Symbolic Computation, 1988
- Solving systems of polynomial inequalities in subexponential timeJournal of Symbolic Computation, 1988
- Some algebraic and geometric computations in PSPACEPublished by Association for Computing Machinery (ACM) ,1988
- Parallel arithmetic computations: A surveyLecture Notes in Computer Science, 1986
- Quantifier elimination for real closed fields by cylindrical algebraic decompostionPublished by Springer Nature ,1975