The complexity of linear problems in fields
From MaRDI portal
Publication:1103602
Recommendations
- The computational complexity of some problems of linear algebra
- The complexity of almost linear diophantine problems
- The proof complexity of linear algebra
- Linear problems in valued fields
- scientific article; zbMATH DE number 4087025
- Complexity of the satisfiability problem for multilinear forms over a finite field
- The computational complexity of some problems of linear algebra (extended abstract)
- STACS 2005
- An upper bound for the complexity of linearized coverings in a finite field
- scientific article; zbMATH DE number 3983069
Cites work
- scientific article; zbMATH DE number 3918343 (Why is no real title available?)
- scientific article; zbMATH DE number 3920550 (Why is no real title available?)
- scientific article; zbMATH DE number 3935016 (Why is no real title available?)
- scientific article; zbMATH DE number 3752829 (Why is no real title available?)
- scientific article; zbMATH DE number 3779296 (Why is no real title available?)
- scientific article; zbMATH DE number 3501006 (Why is no real title available?)
- scientific article; zbMATH DE number 3532959 (Why is no real title available?)
- scientific article; zbMATH DE number 3572309 (Why is no real title available?)
- scientific article; zbMATH DE number 3408928 (Why is no real title available?)
- 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
- Complexity of Boolean algebras
- Definability and fast quantifier elimination in algebraically closed fields
- Elimination of quantifiers in algebraic structures
- Presburger arithmetic with bounded quantifier alternation
- The complexity of Presburger arithmetic with bounded quantifier alternation depth
- The complexity of logical theories
- The computational complexity of logical theories
Cited in
(79)- A geometric method for model reduction of biochemical networks with polynomial rate functions
- Linear quantifier elimination
- Reachability relations of timed pushdown automata
- Adapting real quantifier elimination methods for conflict set computation
- Algorithmic methods for investigating equilibria in epidemic modeling
- Testing binomiality of chemical reaction networks using comprehensive Gröbner systems
- On the complexity of linear arithmetic with divisibility
- Classical numerical methods in engineering: a note on existential quantifier elimination under parametric inequality constraints
- Applied Algebraic Geometry in Model Based Design for Manufacturing
- Counting and Gröbner bases
- On the complexity of quantified linear systems
- On the parallel complexity of the polynomial ideal membership problem
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals
- Sur la complexité du principe de Tarski-Seidenberg
- Efficiently and effectively recognizing toricity of steady state varieties
- A representation of convex semilinear sets
- Model-theoretic methods in combined constraint satisfiability
- Computational complexity of sentences over fields
- Computing Hopf bifurcations in chemical reaction networks using reaction coordinates
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
- scientific article; zbMATH DE number 1405441 (Why is no real title available?)
- The complexity of almost linear diophantine problems
- A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma
- Quantifier elimination in automatic loop parallelization
- Relationships of properties of piecewise affine maps over ordered fields
- Some formal tools for analyzing quantum automata.
- scientific article; zbMATH DE number 1866875 (Why is no real title available?)
- Solution formulas for cubic equations without or with constraints
- Algorithmic reduction of biological networks with multiple time scales
- Identifying the parametric occurrence of multiple steady states for some biological networks
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
- Polynomial Bell inequalities
- Virtual substitution for SMT-solving
- A logic based approach to finding real singularities of implicit ordinary differential equations
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates
- A symbolic-numeric approach to multi-objective optimization in manufacturing design
- Complexity of the satisfiability problem for multilinear forms over a finite field
- A decision algorithm for linear sentences on a PFM
- Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package.
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- A decision procedure for linear ``big O equations
- Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
- On sets of linear forms of maximal complexity
- Solving and visualizing nonlinear parametric constraints in control based on quantifier elimination
- Algorithmic global criteria for excluding oscillations
- scientific article; zbMATH DE number 1507955 (Why is no real title available?)
- Better answers to real questions
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Linear problems in valued fields
- Weak quantifier elimination for the full linear theory of the integers
- A bibliography of quantifier elimination for real closed fields
- A complexity perspective on entailment of parameterized linear constraints
- Proof synthesis and reflection for linear arithmetic
- Analyzing restricted fragments of the theory of linear arithmetic
- On Hierarchical Reasoning in Combinations of Theories
- Convex polarities over ordered fields
- An exact correspondence of linear problems and randomizing linear algorithms
- On quantified linear implications
- Automatic generation of bounds for polynomial systems with application to the Lorenz system
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- Formulation of linear problems and solution by a universal machine
- Tropical effective primary and dual Nullstellensätze
- Quantifier elimination for a class of exponential polynomial formulas
- Linear Programs and Convex Hulls Over Fields of Puiseux Fractions
- An Algebraic Study of Affine Real Ultrafilters
- Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
- Applying term rewriting methods to finite groups
- Verified Quadratic Virtual Substitution for Real Arithmetic
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic
- Multiple object semilinear motion planning
- A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
- Effective Quantifier Elimination for Presburger Arithmetic with Infinity
- Verification of data-aware process models: checking soundness of Data Petri nets
- Supporting global numerical optimization of rational functions by generic symbolic convexity tests
- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)
- Sets of Linear Forms Which Are Hard to Compute
- On complexity of the existential and universal theories of finite fields
- Faster one block quantifier elimination for regular polynomial systems of equations
- Positive existential Definability with unit, addition and coprimeness
This page was built for publication: The complexity of linear problems in fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103602)
