On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
From MaRDI portal
Publication:1185457
DOI10.1016/S0747-7171(10)80004-5zbMath0763.68043OpenAlexW2024271250MaRDI QIDQ1185457
Publication date: 28 June 1992
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(10)80004-5
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Semialgebraic sets and related spaces (14P10)
Related Items
Feasibility testing for systems of real quadratic equations ⋮ On maps which preserve semipositivity and quantifier elimination theory for real numbers ⋮ Interval Linear Algebra and Computational Complexity ⋮ Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints ⋮ Unnamed Item ⋮ The Complexity of Drawing Graphs on Few Lines and Few Planes ⋮ The complexity of the Hausdorff distance ⋮ Quantifier elimination theory and maps which preserve semipositivity ⋮ A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ A note on parallel and alternating time ⋮ FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension ⋮ On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data ⋮ Grid methods in computational real algebraic (and semialgebraic) geometry ⋮ A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors ⋮ Inclusion dynamics hybrid automata ⋮ Special algorithm for stability analysis of multistable biological regulatory systems ⋮ Description of the connected components of a semialgebraic set in single exponential time ⋮ Logics which capture complexity classes over the reals
Cites Work
