Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
From MaRDI portal
Publication:581617
DOI10.1016/S0747-7171(88)80008-7zbMath0689.14006WikidataQ125048139 ScholiaQ125048139MaRDI QIDQ581617
Marie-Françoise Roy, Michel Coste
Publication date: 1988
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
coding of real algebraic numberscylindric algebraic decomposition of a semialgebraic setThom's lemma
Related Items
Towards faster real algebraic numbers, The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements, On the complexity of quadratic programming in real number models of computation, Recent Advances in Real Geometric Reasoning, Fields of algebraic numbers computable in polynomial time. II, A bibliography of quantifier elimination for real closed fields, Reconsidering algorithms for real parametric curves, Generalized polar varieties: geometry and algorithms, Polar varieties, real equation solving, and data structures: the hypersurface case, On computing a set of points meeting every cell defined by a family of polynomials on a variety, Effective asymptotics of linear recurrences with rational coefficients, Positive root isolation for poly-powers by exclusion and differentiation, Proving an execution of an algorithm correct?, An Elementary Recursive Bound for Effective Positivstellensatz and Hilbert’s 17th problem, On the isotopic meshing of an algebraic implicit surface, On the topology of real algebraic plane curves, Does computer algebra help at all learning about real numbers?, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Existence and uniqueness of the real closure of an ordered field without Zorn's lemma, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Quantifier elimination for a class of exponential polynomial formulas, Local parametrization of cubic surfaces, Determinantal formulae for the solution set of zero-dimensional ideals, On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination, A weak version of the Blum, Shub, and Smale model, Polynomial computability of fields of algebraic numbers, NC algorithms for real algebraic numbers, Intrinsic complexity estimates in polynomial optimization, Elementary recursive quantifier elimination based on Thom encoding and sign determination, An algebraic certificate for Budan's theorem, Topology of real algebraic space curves, Computation of the topological type of a real Riemann surface, Obreschkoff's theorem revisited: What convex sets are contained in the set of hyperbolic polynomials?, A parametric representation of totally mixed Nash equilibria, Automatic derivation of the irrationality of \(e\), A theorem on random polynomials and some consequences in average complexity, Spécialisation de la suite de Sturm et sous-résultants (I), Computing roadmaps of semi-algebraic sets on a variety, Sur la complexité du principe de Tarski-Seidenberg, Fully incremental cylindrical algebraic decomposition, Complexity of computation on real algebraic numbers, Unnamed Item, Quantifier elimination by cylindrical algebraic decomposition based on regular chains, Unnamed Item, Generic computation of the real closure of an ordered field., Dynamic evaluation and real closure., Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity, Quantitative curve selection lemma
Cites Work
