Pages that link to "Item:Q1701667"

The following pages link to A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667):

Displayed 9 items.

• Parametric toricity of steady state varieties of reaction networks (Q831994) ‎ (← links)
• Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) ‎ (← links)
• Efficiently and effectively recognizing toricity of steady state varieties (Q2035620) ‎ (← links)
• A logic based approach to finding real singularities of implicit ordinary differential equations (Q2035628) ‎ (← links)
• Algorithmic reduction of biological networks with multiple time scales (Q2051597) ‎ (← links)
• Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) ‎ (← links)
• Editorial: Symbolic computation and satisfiability checking (Q2307620) ‎ (← links)
• Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom? (Q6157640) ‎ (← links)
• Automated exploration of envelopes and offsets with networking of technologies (Q6157645) ‎ (← links)