Finding connected components of a semialgebraic set in subexponential time
- 1 May 1992
- journal article
- research article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 2 (4) , 217-238
- https://doi.org/10.1007/bf01614146
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Sur la complexité du principe de Tarski-SeidenbergBulletin de la Société Mathématiques de France, 1990
- Complexity of deciding Tarski algebraJournal of Symbolic Computation, 1988
- Solving systems of polynomial inequalities in subexponential timeJournal of Symbolic Computation, 1988
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983
- Basic Algebraic GeometryPublished by Springer Nature ,1974
- Lectures on Algebraic TopologyPublished by Springer Nature ,1972
- A Decision Method for Elementary Algebra and GeometryPublished by University of California Press ,1951