Pages that link to "Item:Q1185457"

The following pages link to On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination (Q1185457):

Displaying 24 items.

• On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
• FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
• Inclusion dynamics hybrid automata (Q999262) (← links)
• Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
• A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
• Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
• Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints (Q1921395) (← links)
• Special algorithm for stability analysis of multistable biological regulatory systems (Q2343243) (← links)
• Feasibility testing for systems of real quadratic equations (Q2368126) (← links)
• A note on parallel and alternating time (Q2465291) (← links)
• Quantifier elimination theory and maps which preserve semipositivity (Q2687228) (← links)
• (Q4391222) (← links)
• Interval Linear Algebra and Computational Complexity (Q4554518) (← links)
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
• (Q4993268) (← links)
• Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
• Logics which capture complexity classes over the reals (Q5055931) (← links)
• On maps which preserve semipositivity and quantifier elimination theory for real numbers (Q5065095) (← links)
• The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
• The complexity of the Hausdorff distance (Q6145675) (← links)
• Beyond the Existential Theory of the Reals (Q6489317) (← links)
• Bounding and computing obstacle numbers of graphs (Q6542540) (← links)
• The parametrized complexity of the segment number (Q6618253) (← links)
• Geometric decision procedures and the VC dimension of linear arithmetic theories (Q6649496) (← links)