Pages that link to "Item:Q1114669"
From MaRDI portal
The following pages link to Real quantifier elimination is doubly exponential (Q1114669):
Displaying 50 items.
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates (Q349840) (← links)
- Recent advances in program verification through computer algebra (Q351971) (← links)
- A symbolic-numeric approach to multi-objective optimization in manufacturing design (Q359903) (← links)
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination (Q384995) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- A complex analogue of Toda's theorem (Q454132) (← links)
- Cylindrical algebraic sub-decompositions (Q475412) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- A search-based procedure for nonlinear real arithmetic (Q518407) (← links)
- Elementary recursive quantifier elimination based on Thom encoding and sign determination (Q529166) (← links)
- Algorithmic global criteria for excluding oscillations (Q542032) (← links)
- ModelPlex: verified runtime validation of verified cyber-physical system models (Q681465) (← links)
- Explicit description of 2D parametric solution sets (Q766227) (← links)
- Testing binomiality of chemical reaction networks using comprehensive Gröbner systems (Q831995) (← links)
- Automatic computation of the complete root classification for a parametric polynomial (Q840716) (← links)
- A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
- Testing elementary function identities using CAD (Q944998) (← links)
- Computational complexity of determining which statements about causality hold in different space-time models (Q949614) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- Partial cylindrical algebraic decomposition for quantifier elimination (Q1186711) (← links)
- Comprehensive Gröbner bases (Q1199704) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- Separation of complexity classes in Koiran's weak model (Q1338212) (← links)
- Bellerophon: tactical theorem proving for hybrid systems (Q1687737) (← links)
- raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
- Automatic generation of bounds for polynomial systems with application to the Lorenz system (Q1755304) (← links)
- Lower bounds for arithmetic networks (Q1803554) (← links)
- Automatically discovering relaxed Lyapunov functions for polynomial dynamical systems (Q1949085) (← links)
- Using machine learning to improve cylindrical algebraic decomposition (Q2009221) (← links)
- Efficiently and effectively recognizing toricity of steady state varieties (Q2035620) (← links)
- Cooperating techniques for solving nonlinear real arithmetic in the \texttt{cvc5} SMT solver (system description) (Q2104500) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- An approximate characterisation of the set of feasible trajectories for constrained flat systems (Q2165988) (← links)
- On quantified linear implications (Q2254606) (← links)
- Cylindrical algebraic decomposition with equational constraints (Q2307622) (← links)
- Special algorithm for stability analysis of multistable biological regulatory systems (Q2343243) (← links)
- Computing real witness points of positive dimensional polynomial systems (Q2357373) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries (Q2631966) (← links)
- Parallel running of a modular simulation scheme (Q2640411) (← links)
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- Need Polynomial Systems Be Doubly-Exponential? (Q2819212) (← links)