Beyond the Existential Theory of the Reals
- 12 December 2023
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 68 (2) , 195-226
Abstract
No abstract availableKeywords
All Related Versions
This publication has 39 references indexed in Scilit:
- On the minimum of a positive polynomial over the standard simplexJournal of Symbolic Computation, 2010
- Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda’s TheoremFoundations of Computational Mathematics, 2010
- Exotic Quantifiers, Complexity Classes, and Complete ProblemsFoundations of Computational Mathematics, 2007
- On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier eliminationJournal of Symbolic Computation, 1992
- On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier eliminationJournal of Symbolic Computation, 1992
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- Effective Łojasiewicz inequalities in semialgebraic geometryApplicable Algebra in Engineering, Communication and Computing, 1991
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- The universality theorems on the classification problem of configuration varieties and convex polytopes varieties1988
- Real addition and the polynomial hierarchyInformation Processing Letters, 1985