On the complexity of quantified linear systems
From MaRDI portal
Publication:391791
DOI10.1016/j.tcs.2013.08.001zbMath1358.03051OpenAlexW2157787341MaRDI QIDQ391791
Salvatore Ruggieri, Pavlos Eirinakis, K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.08.001
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
Uses Software
Cites Work
- Real addition and the polynomial hierarchy
- The complexity of linear problems in fields
- Real quantifier elimination is doubly exponential
- The complexity of logical theories
- The computational complexity of multi-level linear programs
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Partial cylindrical algebraic decomposition for quantifier elimination
- A new approach for automatic theorem proving in real geometry
- On a decision procedure for quantified linear programs
- New results on quantifier elimination over real closed fields and applications to constraint databases
- Computational Difficulties of Bilevel Linear Programming
- The polynomial hierarchy and a simple model for competitive analysis
- A Decision Procedure for the First Order Theory of Real Addition with Order
- On the combinatorial and algebraic complexity of quantifier elimination
- QEPCAD B
- Efficient solving of quantified inequality constraints over the real numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the complexity of quantified linear systems
