Pages that link to "Item:Q1113939"

The following pages link to Solving systems of polynomial inequalities in subexponential time (Q1113939):

Displaying 50 items.

• Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
• A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
• Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
• Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
• Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
• On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
• Bounds on the number of connected components for tropical prevarieties (Q517460) (← links)
• Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
• Elementary recursive quantifier elimination based on Thom encoding and sign determination (Q529166) (← links)
• Bounding the radii of balls meeting every connected component of semi-algebraic sets (Q607049) (← links)
• Condition number based complexity estimate for solving polynomial systems (Q629539) (← links)
• Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
• Deciding consistency of systems of exponential-polynomial inequalities in subexponential time (Q684954) (← links)
• Solving systems of polynomial inequalities over a real closed field in subexponential time (Q804242) (← links)
• Oscillation of linear ordinary differential equations: on a theorem of A. Grigoriev (Q867473) (← links)
• Involutions of polynomially parametrized surfaces (Q893108) (← links)
• Nonrealizability proofs in computational geometry (Q912857) (← links)
• A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
• Polynomial bounds for the oscillation of solutions of Fuchsian systems (Q962067) (← links)
• On the intrinsic complexity of point finding in real singular hypersurfaces (Q990944) (← links)
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
• On the number of topological types occurring in a parameterized family of arrangements (Q1006392) (← links)
• Condition number based complexity estimate for computing local extrema (Q1026449) (← links)
• A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
• Smoothing of real algebraic hypersurfaces by rigid isotopies (Q1175677) (← links)
• The complexity of point configurations (Q1175788) (← links)
• Computational algebraic geometry of projective configurations (Q1176393) (← links)
• Recent improvements in the complexity of the effective Nullstellensatz (Q1177257) (← links)
• A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← 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)
• The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747) (← links)
• Counting connected components of a semialgebraic set in subexponential time (Q1207337) (← links)
• Complexity of deciding Tarski algebra (Q1264143) (← links)
• An algorithm for sums of squares of real polynomials (Q1295495) (← links)
• Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
• Construction of roadmaps in semi-algebraic sets (Q1311619) (← 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)
• A lower bound for randomized algebraic decision trees (Q1386178) (← links)
• Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
• Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
• Matrices in elimination theory (Q1808659) (← links)
• Real solving for positive dimensional systems. (Q1867000) (← 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)
• Numerically computing real points on algebraic sets (Q1956231) (← links)
• Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
• Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)