On the complexity of quantified integer programming
Quantified integer programming is the the problem of deciding assertions of the form Qkxk . . . ∀x2 ∃x1 : A·x ≥ c where vectors of variables xk, . . . , x1 form the vector x, all variables are interpreted over N (alternatively, over Z), and A and c are a matrix and vector over Z of appropriate sizes...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Schloss Dagstuhl
2017
|