On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination
Open Access
- 31 March 1992
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 13 (3) , 329-352
- https://doi.org/10.1016/s0747-7171(10)80005-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The complexity of elementary algebra and geometryJournal of Computer and System Sciences, 1986
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967