Pages that link to "Item:Q3140553"
From MaRDI portal
The following pages link to On the Theoretical and Practical Complexity of the Existential Theory of Reals (Q3140553):
Displaying 10 items.
- Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
- Properness defects of projection and minimal discriminant variety (Q719760) (← links)
- Automatic computation of the complete root classification for a parametric polynomial (Q840716) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Real solving for positive dimensional systems. (Q1867000) (← links)
- Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates (Q2457362) (← links)
- Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms (Q2830000) (← links)
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (Q3453240) (← links)
- Finding at least one point in each connected component of a real algebraic set defined by a single equation (Q5925972) (← links)
- VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities (Q6076836) (← links)
