The following pages link to QEPCAD B (Q4810199):
Displaying 50 items.
- QEPCAD (Q13503) (← links)
- 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)
- 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)
- Variant quantifier elimination (Q420753) (← links)
- Applications of real number theorem proving in PVS (Q469367) (← links)
- Cylindrical algebraic sub-decompositions (Q475412) (← links)
- Quantifier elimination for a class of exponential polynomial formulas (Q480651) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- A systematic approach for doing an a priori identifiability study of dynamical nonlinear models (Q669172) (← 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)
- Exact safety verification of hybrid systems using sums-of-squares representation (Q893625) (← links)
- Quantifier elimination supported proofs in the numerical treatment of fluid flows (Q945006) (← links)
- Hybrid automata, reachability, and systems biology (Q969180) (← links)
- MetiTarski: An automatic theorem prover for real-valued special functions (Q972422) (← links)
- Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem (Q1025383) (← links)
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
- Deciding univariate polynomial problems using untrusted certificates in Isabelle/HOL (Q1725844) (← links)
- Global optimization of polynomials over real algebraic sets (Q1730308) (← links)
- Automatic generation of bounds for polynomial systems with application to the Lorenz system (Q1755304) (← links)
- On the algebraic boundaries among typical ranks for real binary forms (Q1790480) (← links)
- Multistationarity in the space of total concentrations for systems that admit a monomial parametrization (Q2008268) (← links)
- Using machine learning to improve cylindrical algebraic decomposition (Q2009221) (← links)
- The impact on the properties of the EFGM copulas when extending this family (Q2049225) (← links)
- Algorithmic reduction of biological networks with multiple time scales (Q2051597) (← links)
- A comparison of algorithms for proving positivity of linearly recurrent sequences (Q2109988) (← links)
- Polynomial bivariate copulas of degree five: characterization and some particular inequalities (Q2245659) (← links)
- A local Fourier convergence analysis of a multigrid method using symbolic computation (Q2252112) (← links)
- On quantified linear implications (Q2254606) (← links)
- Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) (← links)
- Fully incremental cylindrical algebraic decomposition (Q2307621) (← links)
- Cylindrical algebraic decomposition with equational constraints (Q2307622) (← links)
- Special algorithm for stability analysis of multistable biological regulatory systems (Q2343243) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) (Q2635072) (← links)
- An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions (Q2799562) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- On the Feasibility of Semi-algebraic Sets in Poisson Regression (Q2819210) (← links)
- Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms (Q2830000) (← links)
- Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems (Q2835688) (← links)
- Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants (Q2842646) (← links)
- Formal Modelling, Analysis and Verification of Hybrid Systems (Q2948232) (← links)
