Solving systems of polynomial inequalities in subexponential time
Authors:
- D. Yu. Grigor'EvDGD. Yu. Grigor'Ev
- N.N. VorobjovNVN.N. Vorobjov
- 1 February 1988
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 5 (1-2) , 37-64
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983
- Quantifier elimination for real closed fields by cylindrical algebraic decompostion1975
- 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