scientific article; zbMATH DE number 3564960
From MaRDI portal
zbMath0363.02052MaRDI QIDQ4137157
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Decidability and field theory (12L05) Model-theoretic algebra (03C60) Decidability of theories and sets of sentences (03B25)
Related Items
Estimates of real roots of a system of algebraic equations, Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets, Complexity of stratifications of semi-Pfaffian sets, A bibliography of quantifier elimination for real closed fields, Solving systems of polynomial inequalities in subexponential time, Effective Łojasiewicz inequalities in semialgebraic geometry, Computing the homology of real projective sets, The complexity of deciding consistency of systems of polynomials in exponent inequalities, A numerical algorithm for zero counting. I: Complexity and accuracy, Grid methods in computational real algebraic (and semialgebraic) geometry, Complexity of cylindrical decompositions of sub-Pfaffian, Complexity of deciding the first-order theory of real closed fields, On exact Reznick, Hilbert-Artin and Putinar's representations, Some lower bounds for the complexity of the linear programming feasibility problem over the reals, Computing the homology of semialgebraic sets. I: Lax formulas, Computing the homology of semialgebraic sets. II: General formulas, Complexity of deciding Tarski algebra, Finding connected components of a semialgebraic set in subexponential time, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, Definability and fast quantifier elimination in algebraically closed fields, Description of the connected components of a semialgebraic set in single exponential time
