Counting connected components of a semialgebraic set in subexponential time
- 1 June 1992
- journal article
- Published by Springer Nature in computational complexity
- Vol. 2 (2) , 133-186
- https://doi.org/10.1007/bf01202001
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Finding connected components of a semialgebraic set in subexponential timeApplicable Algebra in Engineering, Communication and Computing, 1992
- 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
- The complexity of elementary algebra and geometryJournal of Computer and System Sciences, 1986
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983
- IX. Ein Entscheidungsverfahren für die Theorie der reell-abgeschlossenen KörperPublished by Springer Nature ,1976
- Quantifier elimination for real closed fields by cylindrical algebraic decompostionPublished by Springer Nature ,1975
- Basic Algebraic GeometryPublished by Springer Nature ,1974
- Lectures on Algebraic TopologyPublished by Springer Nature ,1972