The following pages link to REDLOG (Q16433):
Displaying 50 items.
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares (Q258393) (← links)
- A hypergeometric inequality (Q259718) (← links)
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates (Q349840) (← links)
- Stability analysis for discrete biological models using algebraic methods (Q359890) (← links)
- An SOS-QE approach to nonlinear gain analysis for polynomial dynamical systems (Q359900) (← links)
- A symbolic-numeric approach to multi-objective optimization in manufacturing design (Q359903) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← 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)
- Symbolic decision procedure for termination of linear programs (Q539162) (← links)
- Algorithmic global criteria for excluding oscillations (Q542032) (← links)
- Solution formulas for cubic equations without or with constraints (Q548598) (← links)
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- Gröbner bases for polynomial systems with parameters (Q607062) (← links)
- On the computation of parametric Gröbner bases for modules and syzygies (Q623733) (← links)
- How to use cylindrical algebraic decomposition (Q624830) (← links)
- Towards an automated reduction method for polynomial ODE models of biochemical reaction systems (Q626876) (← links)
- Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology (Q626879) (← links)
- Deciding polynomial-transcendental problems (Q654031) (← links)
- Quantifier elimination for real algebra -- the quadratic case and beyond (Q677553) (← links)
- Symbol elimination and applications to parametric entailment problems (Q831921) (← links)
- Parametric toricity of steady state varieties of reaction networks (Q831994) (← links)
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs (Q882517) (← links)
- Multiphase until formulas over Markov reward models: an algebraic approach (Q896909) (← links)
- Better answers to real questions (Q898260) (← links)
- Change-of-bases abstractions for non-linear hybrid systems (Q901261) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- Quantifier elimination supported proofs in the numerical treatment of fluid flows (Q945006) (← links)
- Minimal canonical comprehensive Gröbner systems (Q1012136) (← links)
- Combining logical and algebraic techniques for natural style proving in elementary analysis (Q1025313) (← 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)
- Computational complexity and feasibility of data processing and interval computations (Q1377914) (← links)
- Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package. (Q1568438) (← links)
- Deciding Hopf bifurcations by quantifier elimination in a software-component architecture (Q1582300) (← links)
- Linear problems in valued fields (Q1582303) (← links)
- A Kochen-Specker system has at least 22 vectors (Q1670503) (← 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)
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas (Q1735326) (← links)
- Automatic generation of bounds for polynomial systems with application to the Lorenz system (Q1755304) (← links)
- The Gröbner cover (Q1755631) (← links)
- Positive solutions of systems of signed parametric polynomial inequalities (Q1798326) (← links)
- Automatically discovering relaxed Lyapunov functions for polynomial dynamical systems (Q1949085) (← links)
- PTIME parametric verification of safety properties for reasonable linear hybrid automata (Q1949771) (← links)
- Multistationarity in the space of total concentrations for systems that admit a monomial parametrization (Q2008268) (← links)
