Pages that link to "Item:Q1103602"
From MaRDI portal
The following pages link to The complexity of linear problems in fields (Q1103602):
Displayed 50 items.
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates (Q349840) (← links)
- A symbolic-numeric approach to multi-objective optimization in manufacturing design (Q359903) (← links)
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination (Q384995) (← links)
- On the complexity of quantified linear systems (Q391791) (← 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)
- Algorithmic global criteria for excluding oscillations (Q542032) (← links)
- Solution formulas for cubic equations without or with constraints (Q548598) (← links)
- Model-theoretic methods in combined constraint satisfiability (Q556677) (← links)
- Linear quantifier elimination (Q707743) (← links)
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692) (← links)
- Testing binomiality of chemical reaction networks using comprehensive Gröbner systems (Q831995) (← links)
- Better answers to real questions (Q898260) (← links)
- Relationships of properties of piecewise affine maps over ordered fields (Q919066) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- Solving and visualizing nonlinear parametric constraints in control based on quantifier elimination (Q945005) (← links)
- Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
- A representation of convex semilinear sets (Q987186) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
- Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields (Q1184352) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- Formulation of linear problems and solution by a universal machine (Q1338141) (← links)
- Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package. (Q1568438) (← links)
- Linear problems in valued fields (Q1582303) (← links)
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
- Tropical effective primary and dual Nullstellensätze (Q1745195) (← links)
- Automatic generation of bounds for polynomial systems with application to the Lorenz system (Q1755304) (← 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)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma (Q2239081) (← links)
- On quantified linear implications (Q2254606) (← links)
- Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- Algorithmic methods for investigating equilibria in epidemic modeling (Q2457392) (← links)
- Quantifier elimination in automatic loop parallelization (Q2457396) (← links)
- Multiple object semilinear motion planning (Q2457425) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- A decision procedure for linear ``big O'' equations (Q2642465) (← links)
- Convex polarities over ordered fields (Q2655008) (← links)
- On Interpolation and Symbol Elimination in Theory Extensions (Q2817926) (← links)
- Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates (Q2914990) (← links)
- Polynomial Bell Inequalities (Q2960675) (← links)
- Adapting Real Quantifier Elimination Methods for Conflict Set Computation (Q2964460) (← links)
- Virtual Substitution for SMT-Solving (Q3088298) (← links)
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (Q3453240) (← links)