On the Complexity of Quantified Integer Programming
From MaRDI portal
Publication:5111426
DOI10.4230/LIPIcs.ICALP.2017.94zbMath1442.68069OpenAlexW2741124207MaRDI QIDQ5111426
Christoph Haase, Dmitry Chistikov
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.94
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (2)
On the complexity of robust multi-stage problems with discrete recourse ⋮ On commensurability of right-angled Artin groups II: RAAGs defined by paths
This page was built for publication: On the Complexity of Quantified Integer Programming