Pages that link to "Item:Q4713865"

The following pages link to Sur la complexité du principe de Tarski-Seidenberg (Q4713865):

Displaying 27 items.

• Metric properties of semialgebraic mappings (Q309643) (← links)
• Condition number based complexity estimate for solving polynomial systems (Q629539) (← links)
• Oscillation of linear ordinary differential equations: on a theorem of A. Grigoriev (Q867473) (← links)
• Polynomial bounds for the oscillation of solutions of Fuchsian systems (Q962067) (← links)
• On sign conditions over real multivariate polynomials (Q977180) (← links)
• Effective Łojasiewicz inequalities in semialgebraic geometry (Q1177863) (← links)
• 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 (Q1185456) (← links)
• \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) (Q1201156) (← links)
• Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
• Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
• Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
• Finding irreducible components of some real transcendental varieties (Q1332661) (← links)
• Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
• Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
• Homogeneous multivariate polynomials with the half-plane property (Q1432999) (← links)
• Real computations with fake numbers (Q1599196) (← links)
• Learning from rounded-off data. (Q1873753) (← links)
• Un procédé d'élimination effective et quelques applications. (A procedure for effective elimination and some applications.) (Q1891886) (← links)
• Complexity of stratifications of semi-Pfaffian sets (Q1894719) (← links)
• Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
• Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
• Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
• An unfeasibility view of neural network learning (Q2685066) (← links)
• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
• Une borne optimale pour la programmation entière quasi-convexe (Q3136700) (← links)
• A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)