The following pages link to QEPCAD (Q13503):
Displaying 50 items.
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares (Q258393) (← links)
- A hypergeometric inequality (Q259718) (← links)
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates (Q349840) (← links)
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Stability analysis for discrete biological models using algebraic methods (Q359890) (← links)
- An SOS-QE approach to nonlinear gain analysis for polynomial dynamical systems (Q359900) (← links)
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination (Q384995) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- On invariant checking (Q394493) (← links)
- Dominance in the family of Sugeno-Weber t-norms (Q409766) (← links)
- Some geometric properties of successive difference substitutions (Q415953) (← links)
- Computing integrals over polynomially defined regions and their boundaries in 2 and 3 dimensions (Q417963) (← links)
- Variant quantifier elimination (Q420753) (← links)
- Polynomial function intervals for floating-point software verification (Q457251) (← links)
- Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification (Q462854) (← links)
- Applications of real number theorem proving in PVS (Q469367) (← links)
- Cylindrical algebraic sub-decompositions (Q475412) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- Quantifier elimination for a class of exponential polynomial formulas (Q480651) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- On using Lazard's projection in CAD construction (Q492024) (← 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)
- Construction of parametric barrier functions for dynamical systems using interval analysis (Q518335) (← links)
- A search-based procedure for nonlinear real arithmetic (Q518407) (← links)
- Symbolic decision procedure for termination of linear programs (Q539162) (← links)
- Algorithmic global criteria for excluding oscillations (Q542032) (← links)
- Solution formulas for cubic equations without or with constraints (Q548598) (← links)
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- Visually dynamic presentation of proofs in plane geometry. II: Automated generation of visually dynamic presentations with the full-angle method and the deductive database method (Q616847) (← links)
- Towards an automated reduction method for polynomial ODE models of biochemical reaction systems (Q626876) (← links)
- Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology (Q626879) (← links)
- An algorithm for determining copositive matrices (Q636239) (← links)
- Solving parametric piecewise polynomial systems (Q651936) (← links)
- A systematic approach for doing an a priori identifiability study of dynamical nonlinear models (Q669172) (← links)
- Lack-of-contact conditions for a penny-shaped crack under a polynomial normal loading (Q671211) (← links)
- A note on dead-beat controllability of generalised Hammerstein systems (Q673277) (← links)
- Quantifier elimination for real algebra -- the quadratic case and beyond (Q677553) (← links)
- A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets (Q681340) (← links)
- ModelPlex: verified runtime validation of verified cyber-physical system models (Q681465) (← links)
- Polyhedral and algebraic methods in computational geometry (Q691570) (← links)
- Optimizing a particular real root of a polynomial by a special cylindrical algebraic decomposition (Q691649) (← links)
- Parametric toricity of steady state varieties of reaction networks (Q831994) (← links)
- Automatic computation of the complete root classification for a parametric polynomial (Q840716) (← links)
- Geometry and topology of parameter space: Investigating measures of robustness in regulatory networks (Q843306) (← links)
- Products of foldable triangulations (Q875253) (← links)
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs (Q882517) (← links)
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty (Q892228) (← links)
- Exact safety verification of hybrid systems using sums-of-squares representation (Q893625) (← links)
