Pages that link to "Item:Q1113939"

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

Displaying 50 items.

• On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
• Efficiently and effectively recognizing toricity of steady state varieties (Q2035620) (← links)
• Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
• Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
• Smooth points on semi-algebraic sets (Q2100053) (← links)
• Cooperating techniques for solving nonlinear real arithmetic in the \texttt{cvc5} SMT solver (system description) (Q2104500) (← links)
• When a system of real quadratic equations has a solution (Q2143674) (← links)
• An approximate characterisation of the set of feasible trajectories for constrained flat systems (Q2165988) (← links)
• Real root finding for low rank linear matrices (Q2175227) (← links)
• Links with splitting number one (Q2230973) (← links)
• Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
• On the geometry of polar varieties (Q2267371) (← links)
• Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) (← links)
• Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
• Segment representations with small resolution (Q2338214) (← links)
• Feasibility testing for systems of real quadratic equations (Q2368126) (← links)
• Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
• A PTAS for the disk cover problem of geometric objects (Q2450711) (← links)
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
• Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) (← links)
• A potential reduction algorithm for two-person zero-sum mean payoff stochastic games (Q2636482) (← links)
• Computing final polynomials and final syzygies using Buchberger's Gröbner bases method (Q2639107) (← links)
• Systole length in hyperbolic \(n\)-manifolds (Q2673907) (← links)
• Computing a nonnegative matrix factorization -- provably (Q2817794) (← links)
• A Survey of Satisfiability Modulo Theory (Q2830018) (← links)
• Exact algorithms for linear matrix inequalities (Q2834563) (← links)
• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
• Solving polynomial equations in smoothed polynomial time and a near solution to Smale's 17th problem (Q2875178) (← links)
• MRHS Equation Systems that can be Solved in Polynomial Time (Q2970278) (← links)
• The Number of Bits Needed to Represent a Unit Disk Graph (Q3057635) (← links)
• Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets (Q3451759) (← links)
• Recent Advances in Real Geometric Reasoning (Q3452275) (← links)
• (Q3485804) (← links)
• Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping (Q3597979) (← links)
• Combined Decision Techniques for the Existential Theory of the Reals (Q3637273) (← links)
• Deciding consistency of systems of polynomials in exponent inequalities in subexponential time (Q3973352) (← links)
• Sur la complexité du principe de Tarski-Seidenberg (Q4713865) (← links)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768) (← links)
• (Q5090442) (← links)
• An Elementary Recursive Bound for Effective Positivstellensatz and Hilbert’s 17th problem (Q5108709) (← links)
• The Complexity of Positive Semidefinite Matrix Factorization (Q5355204) (← links)
• (Q5389777) (← links)
• Computing Amoebas (Q5472047) (← links)
• Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)
• Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients (Q5883314) (← links)
• On the Complexity of Equilibrium Computation in First-Price Auctions (Q5885597) (← links)
• An algorithmic approach to Rupert’s problem (Q5886883) (← links)
• The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609) (← links)
• Finding at least one point in each connected component of a real algebraic set defined by a single equation (Q5925972) (← links)
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD (Q5933499) (← links)