The following pages link to (Q4247790):
Displaying 21 items.
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination (Q384995) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- Quantifier-free encoding of invariants for hybrid systems (Q479826) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← 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)
- Algorithmic global criteria for excluding oscillations (Q542032) (← links)
- Parametric toricity of steady state varieties of reaction networks (Q831994) (← links)
- Better answers to real questions (Q898260) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- MetiTarski: An automatic theorem prover for real-valued special functions (Q972422) (← links)
- Combining logical and algebraic techniques for natural style proving in elementary analysis (Q1025313) (← links)
- Linear problems in valued fields (Q1582303) (← links)
- New techniques for linear arithmetic: cubes and equalities (Q1688532) (← links)
- On solving parametric polynomial systems (Q1949089) (← links)
- Algorithmic reduction of biological networks with multiple time scales (Q2051597) (← links)
- On generalizing Descartes' rule of signs to hypersurfaces (Q2172219) (← links)
- On quantified linear implications (Q2254606) (← links)
- Virtual Substitution for SMT-Solving (Q3088298) (← links)
- Timed Basic Parallel Processes (Q5875376) (← links)
- Computing with Tarski formulas and semi-algebraic sets in a web browser (Q6170823) (← links)
