The following pages link to Thomas Sturm (Q349839):
Displaying 44 items.
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates (Q349840) (← links)
- Algorithmic global criteria for excluding oscillations (Q542032) (← links)
- Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology (Q626879) (← links)
- Parametric toricity of steady state varieties of reaction networks (Q831994) (← links)
- Testing binomiality of chemical reaction networks using comprehensive Gröbner systems (Q831995) (← links)
- Better answers to real questions (Q898260) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- A new approach for automatic theorem proving in real geometry (Q1272610) (← links)
- Reasoning over networks by symbolic methods (Q1304767) (← links)
- Simplification of quantifier-free formulae over ordered fields (Q1368694) (← links)
- Linear problems in valued fields (Q1582303) (← links)
- Subtropical satisfiability (Q1687555) (← links)
- Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks (Q1701474) (← links)
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
- Positive solutions of systems of signed parametric polynomial inequalities (Q1798326) (← 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)
- A linear algebra approach for detecting binomiality of steady state ideals of reversible chemical reaction networks (Q2110245) (← links)
- First-order tests for toricity (Q2110246) (← links)
- Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) (← links)
- A complete and terminating approach to linear integer solving (Q2307624) (← links)
- (Q2702025) (← links)
- (Q2760201) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- Subtropical Real Root Finding (Q2819779) (← links)
- Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages (Q2849482) (← links)
- Towards Conflict-Driven Learning for Virtual Substitution (Q2879330) (← links)
- Parametric quantified SAT solving (Q2946524) (← links)
- Automatic Verification of the Adequacy of Models for Families of Geometric Objects (Q3003231) (← links)
- On Muldowney’s Criteria for Polynomial Vector Fields with Constraints (Q3090897) (← links)
- Linear Integer Arithmetic Revisited (Q3454126) (← links)
- Weak Integer Quantifier Elimination Beyond the Linear Case (Q3508492) (← links)
- New Domains for Applied Quantifier Elimination (Q3511123) (← links)
- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk) (Q3587714) (← links)
- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests (Q3589077) (← links)
- Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology (Q3599203) (← links)
- Effective Quantifier Elimination for Presburger Arithmetic with Infinity (Q3644100) (← links)
- (Q3838772) (← links)
- (Q4226991) (← links)
- (Q4232480) (← links)
- (Q4247790) (← links)
- A Case Study on the Parametric Occurrence of Multiple Steady States (Q5119921) (← links)
- Reduction of Chemical Reaction Networks with Approximate Conservation Laws (Q6144492) (← links)
