On the complexity of quantified integer programming

DOI10.4230/LIPICS.ICALP.2017.94MaRDI QIDQ5111426zbMATHOpenAlexFDO

Authors Christoph Haase, Dmitry Chistikov

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.ICALP.2017.94

zbMATH Keywords

integer programmingquantifier eliminationPresburger arithmeticsemi-linear sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• The computational complexity of integer programming with alternations
• The computational complexity of integer programming with alternations
• Automated Reasoning
• Tractable fragments of Presburger arithmetic
• On a decision procedure for quantified linear programs

Cited in

(10)

• Polynomial time certifying algorithms for the planar quantified integer programming problem
• On the complexity of robust multi-stage problems with discrete recourse
• On the complexity of quantified linear systems
• The computational complexity of integer programming with alternations
• On commensurability of right-angled Artin groups II: RAAGs defined by paths
• Integer programming models for the \(q\)-mode problem
• Automated Reasoning
• On the complexity of the quantified bit-vector arithmetic with binary encoding
• The computational complexity of integer programming with alternations
• On the complexity of quadratic programming in real number models of computation

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)