On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination
Open Access
- 31 March 1992
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 13 (3) , 301-327
- https://doi.org/10.1016/s0747-7171(10)80004-5
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic setsJournal of Symbolic Computation, 1988
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976