Pages that link to "Item:Q581617"

The following pages link to Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets (Q581617):

Displaying 47 items.

• On the isotopic meshing of an algebraic implicit surface (Q414623) (← links)
• Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
• Quantifier elimination for a class of exponential polynomial formulas (Q480651) (← links)
• Elementary recursive quantifier elimination based on Thom encoding and sign determination (Q529166) (← links)
• An algebraic certificate for Budan's theorem (Q531342) (← links)
• On the topology of real algebraic plane curves (Q626980) (← links)
• A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
• Complexity of computation on real algebraic numbers (Q757065) (← links)
• A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
• A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
• Existence and uniqueness of the real closure of an ordered field without Zorn's lemma (Q1176709) (← links)
• A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
• Determinantal formulae for the solution set of zero-dimensional ideals (Q1181435) (← links)
• On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination (Q1185457) (← links)
• NC algorithms for real algebraic numbers (Q1201334) (← links)
• Obreschkoff's theorem revisited: What convex sets are contained in the set of hyperbolic polynomials? (Q1207527) (← links)
• On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
• Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
• On computing a set of points meeting every cell defined by a family of polynomials on a variety (Q1361873) (← links)
• Does computer algebra help at all learning about real numbers? (Q1404700) (← links)
• Generic computation of the real closure of an ordered field. (Q1565819) (← links)
• Dynamic evaluation and real closure. (Q1565836) (← links)
• Towards faster real algebraic numbers (Q1878487) (← links)
• Reconsidering algorithms for real parametric curves (Q1901474) (← links)
• Effective asymptotics of linear recurrences with rational coefficients (Q1917520) (← links)
• Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
• Quantitative curve selection lemma (Q2114147) (← links)
• Fields of algebraic numbers computable in polynomial time. II (Q2145863) (← links)
• Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
• A theorem on random polynomials and some consequences in average complexity (Q2277521) (← links)
• Fully incremental cylindrical algebraic decomposition (Q2307621) (← links)
• Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
• Positive root isolation for poly-powers by exclusion and differentiation (Q2409014) (← links)
• Local parametrization of cubic surfaces (Q2457313) (← links)
• Topology of real algebraic space curves (Q2481475) (← links)
• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
• The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements (Q3162519) (← links)
• Spécialisation de la suite de Sturm et sous-résultants (I) (Q3358238) (← links)
• Recent Advances in Real Geometric Reasoning (Q3452275) (← links)
• (Q3476962) (← links)
• Computing roadmaps of semi-algebraic sets on a variety (Q4700178) (← links)
• Sur la complexité du principe de Tarski-Seidenberg (Q4713865) (← links)
• An Elementary Recursive Bound for Effective Positivstellensatz and Hilbert’s 17th problem (Q5108709) (← links)
• (Q5389777) (← links)
• Computation of the topological type of a real Riemann surface (Q5418490) (← links)
• Quantifier elimination by cylindrical algebraic decomposition based on regular chains (Q5925208) (← links)
• Automatic derivation of the irrationality of \(e\) (Q5950931) (← links)