The complexity of linear problems in fields
From MaRDI portal
Publication:1103602
DOI10.1016/S0747-7171(88)80003-8zbMath0646.03005MaRDI QIDQ1103602
Publication date: 1988
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Decidability and field theory (12L05) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (66)
Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic ⋮ Testing binomiality of chemical reaction networks using comprehensive Gröbner systems ⋮ Formulation of linear problems and solution by a universal machine ⋮ SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving ⋮ Applied Algebraic Geometry in Model Based Design for Manufacturing ⋮ Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates ⋮ A bibliography of quantifier elimination for real closed fields ⋮ A decision procedure for linear ``big O equations ⋮ Detection of Hopf bifurcations in chemical reaction networks using convex coordinates ⋮ Convex polarities over ordered fields ⋮ A symbolic-numeric approach to multi-objective optimization in manufacturing design ⋮ An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination ⋮ Applying term rewriting methods to finite groups ⋮ On the complexity of quantified linear systems ⋮ Better answers to real questions ⋮ Polynomial Bell Inequalities ⋮ Unnamed Item ⋮ Adapting Real Quantifier Elimination Methods for Conflict Set Computation ⋮ Verification of data-aware process models: checking soundness of Data Petri nets ⋮ A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications ⋮ Relationships of properties of piecewise affine maps over ordered fields ⋮ Reachability relations of timed pushdown automata ⋮ Unnamed Item ⋮ Quantifier elimination for a class of exponential polynomial formulas ⋮ Algorithmic methods for investigating equilibria in epidemic modeling ⋮ Quantifier elimination in automatic loop parallelization ⋮ Multiple object semilinear motion planning ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields ⋮ Weak quantifier elimination for the full linear theory of the integers ⋮ Solving and visualizing nonlinear parametric constraints in control based on quantifier elimination ⋮ Proof synthesis and reflection for linear arithmetic ⋮ A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma ⋮ Tropical effective primary and dual Nullstellensätze ⋮ Analyzing restricted fragments of the theory of linear arithmetic ⋮ Automatic generation of bounds for polynomial systems with application to the Lorenz system ⋮ Classical numerical methods in engineering: a note on existential quantifier elimination under parametric inequality constraints ⋮ On quantified linear implications ⋮ Counting and Gröbner bases ⋮ Algorithmic global criteria for excluding oscillations ⋮ Solution formulas for cubic equations without or with constraints ⋮ Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk) ⋮ Some formal tools for analyzing quantum automata. ⋮ Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests ⋮ Model-theoretic methods in combined constraint satisfiability ⋮ Linear quantifier elimination ⋮ On Hierarchical Reasoning in Combinations of Theories ⋮ A representation of convex semilinear sets ⋮ An Algebraic Study of Affine Real Ultrafilters ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Identifying the parametric occurrence of multiple steady states for some biological networks ⋮ Some lower bounds for the complexity of the linear programming feasibility problem over the reals ⋮ Efficiently and effectively recognizing toricity of steady state varieties ⋮ A logic based approach to finding real singularities of implicit ordinary differential equations ⋮ A geometric method for model reduction of biochemical networks with polynomial rate functions ⋮ Algorithmic reduction of biological networks with multiple time scales ⋮ On Interpolation and Symbol Elimination in Theory Extensions ⋮ Sur la complexité du principe de Tarski-Seidenberg ⋮ Virtual Substitution for SMT-Solving ⋮ Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields ⋮ On the parallel complexity of the polynomial ideal membership problem ⋮ Effective Quantifier Elimination for Presburger Arithmetic with Infinity ⋮ Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package. ⋮ An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms ⋮ Linear problems in valued fields ⋮ A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
Cites Work
- Elimination of quantifiers in algebraic structures
- Definability and fast quantifier elimination in algebraically closed fields
- Complexity of Boolean algebras
- The complexity of logical theories
- The complexity of Presburger arithmetic with bounded quantifier alternation depth
- The computational complexity of logical theories
- A Decision Procedure for the First Order Theory of Real Addition with Order
- Bounds on transfer principles for algebraically closed and complete discretely valued fields
- Presburger arithmetic with bounded quantifier alternation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The complexity of linear problems in fields
