The following pages link to QEPCAD (Q13503):
Displaying 20 items.
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates (Q349840) (← links)
- Variant quantifier elimination (Q420753) (← links)
- Cylindrical algebraic sub-decompositions (Q475412) (← links)
- On using Lazard's projection in CAD construction (Q492024) (← links)
- Symbolic decision procedure for termination of linear programs (Q539162) (← links)
- Solution formulas for cubic equations without or with constraints (Q548598) (← links)
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty (Q892228) (← links)
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
- Open weak CAD and its applications (Q1711996) (← links)
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) (Q2635072) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- Automated theorem proving for special functions (Q2819703) (← links)
- Building Bridges between Symbolic Computation and Satisfiability Checking (Q2819729) (← links)
- Optimising Problem Formulation for Cylindrical Algebraic Decomposition (Q2843003) (← links)
- Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains (Q2879312) (← links)
- Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases (Q2907329) (← links)
- Real Algebraic Strategies for MetiTarski Proofs (Q2907335) (← links)
- Periodically Controlled Hybrid Systems (Q3624588) (← links)
- A repository for CAD examples (Q5176436) (← links)
- MetiTarski: An Automatic Prover for the Elementary Functions (Q5505501) (← links)
