Solving systems of polynomial inequalities in subexponential time
- 30 April 1988
- journal article
- Published by Elsevier BV in Journal of Symbolic Computation
- Vol. 5 (1-2), 37-64
- https://doi.org/10.1016/s0747-7171(88)80005-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Factoring multivariate polynomials over algebraic number fieldsPublished by Springer Science and Business Media LLC ,2006
- Complexity of quantifier elimination in the theory of algebraically closed fieldsPublished by Springer Science and Business Media LLC ,2005
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983
- Quantifier elimination for real closed fields by cylindrical algebraic decompostionPublished by Springer Science and Business Media LLC ,1975
- An inequality about factors of polynomialsMathematics of Computation, 1974
- Integer Arithmetic Algorithms for Polynomial Real Zero DeterminationJournal of the ACM, 1971
- On the Betti numbers of real varietiesProceedings of the American Mathematical Society, 1964