On the Theoretical and Practical Complexity of the Existential Theory of Reals
From MaRDI portal
Publication:3140553
DOI10.1093/comjnl/36.5.427zbMath0780.68058MaRDI QIDQ3140553
Marie-Françoise Roy, Joos Heintz, Pablo Solernó
Publication date: 1993
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/36.5.427
68Q25: Analysis of algorithms and problem complexity
03B25: Decidability of theories and sets of sentences
Related Items
Finding at least one point in each connected component of a real algebraic set defined by a single equation, Proving inequalities and solving global optimization problems via simplified CAD projection, Properness defects of projection and minimal discriminant variety, Automatic computation of the complete root classification for a parametric polynomial, Some lower bounds for the complexity of the linear programming feasibility problem over the reals, Real solving for positive dimensional systems., Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates