scientific article
From MaRDI portal
zbMath0704.03013MaRDI QIDQ3483265
Joos Heintz, Pablo Solernó, Marie-Françoise Roy
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel complexityreal closed fieldordered fieldssequential complexityTarski-Seidenberg principlealgorithm computing a quantifier free formula
Analysis of algorithms and problem complexity (68Q25) Model-theoretic algebra (03C60) Global ground fields in algebraic geometry (14G25) Model theory of fields (12L12) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
Generalized polar varieties: geometry and algorithms, Polar varieties, real equation solving, and data structures: the hypersurface case, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Effective Łojasiewicz inequalities in semialgebraic geometry, Finding connected components of a semialgebraic set in subexponential time, Sur la complexité du principe de Tarski-Seidenberg, Unnamed Item, Une borne optimale pour la programmation entière quasi-convexe, Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
