On quantified linear implications
DOI10.1007/S10472-013-9332-3zbMATH Open1319.68102OpenAlexW2049924983MaRDI QIDQ2254606FDOQ2254606
Authors: Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski 
Publication date: 5 February 2015
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-013-9332-3
Recommendations
computational complexitypolynomial hierarchylinear constraintsquantified linear implicationinclusion query over polyhedral sets
Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- QEPCAD B
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The polynomial-time hierarchy
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- Types and programing languages
- The complexity of linear problems in fields
- Real quantifier elimination is doubly exponential
- Geometric algorithm for multiparametric linear programming
- Title not available (Why is that?)
- On a decision procedure for quantified linear programs
- Efficient solving of quantified inequality constraints over the real numbers
- Computational complexity of parametric linear programming
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- An analysis of totally clairvoyant scheduling
- Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs
- A complexity perspective on entailment of parameterized linear constraints
- Specification, validation, and synthesis of email agent controllers: A case study in function rich reactive system design
- Title not available (Why is that?)
- Alfred Tarski's elimination theory for real closed fields
- An analysis of partially Clairvoyant scheduling
Cited In (7)
- Title not available (Why is that?)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic
- On a decision procedure for quantified linear programs
- Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
- Linear concepts and hidden variables
- Title not available (Why is that?)
- Analyzing restricted fragments of the theory of linear arithmetic
Uses Software
This page was built for publication: On quantified linear implications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254606)
