On the complexity of quantified integer programming
From MaRDI portal
(Redirected from Publication:5111426)
Recommendations
Cited in
(16)- On the complexity of quantified linear systems
- On the complexity of the quantified bit-vector arithmetic with binary encoding
- Universal quantification makes automatic structures hard to decide
- Automated Reasoning
- The computational complexity of integer programming with alternations
- Integer programming models for the q-mode problem
- On the complexity of robust multi-stage problems with discrete recourse
- On polynomial-time decidability of k-negations fragments of first-order theories
- Universal quantification makes automatic structures hard to decide
- On the power of ordering in linear arithmetic theories
- Formal languages and arithmetic theories: recent results and open problems
- On the complexity of quadratic programming in real number models of computation
- The computational complexity of integer programming with alternations
- An introduction to the theory of linear integer arithmetic (invited paper)
- On commensurability of right-angled Artin groups II: RAAGs defined by paths
- Polynomial time certifying algorithms for the planar quantified integer programming problem
This page was built for publication: On the complexity of quantified integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111426)