scientific article
From MaRDI portal
zbMath0704.03014MaRDI QIDQ3483266
Jacques Morgenstern, Noaï Fitchas, Andre Galligo
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
fast algorithmsparallel algorithmselementary theoryalgebraically closed fieldsreal-closed fieldssequential algorithms
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Global ground fields in algebraic geometry (14G25) Distributed algorithms (68W15) Model theory of fields (12L12) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
Effective Łojasiewicz inequalities in semialgebraic geometry, On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals, On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination, Some lower bounds for the complexity of the linear programming feasibility problem over the reals, Sur la complexité du principe de Tarski-Seidenberg
