On quantified linear implications

DOI10.1007/s10472-013-9332-3zbMath1319.68102OpenAlexW2049924983MaRDI QIDQ2254606

Salvatore Ruggieri, Pavlos Eirinakis, Piotr J. Wojciechowski, K. Subramani and Vahan Mkrtchyan

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

zbMATH Keywords

computational complexitylinear constraintspolynomial hierarchyquantified linear implicationinclusion query over polyhedral sets

Mathematics Subject Classification ID

Linear programming (90C05) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic ⋮ Analyzing restricted fragments of the theory of linear arithmetic ⋮ Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty

Uses Software

• QEPCAD
• REDLOG
• RSOLVER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complexity perspective on entailment of parameterized linear constraints
• Geometric algorithm for multiparametric linear programming
• On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
• The complexity of linear problems in fields
• Real quantifier elimination is doubly exponential
• The polynomial-time hierarchy
• An analysis of partially Clairvoyant scheduling
• Specification, validation, and synthesis of email agent controllers: A case study in function rich reactive system design
• On a decision procedure for quantified linear programs
• An analysis of totally clairvoyant scheduling
• Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs
• Alfred Tarski's elimination theory for real closed fields
• Computational complexity of parametric linear programming
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• QEPCAD B
• Efficient solving of quantified inequality constraints over the real numbers

This page was built for publication: On quantified linear implications