On the complexity of quantified integer programming (Q5111426)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of quantified integer programming |
scientific article; zbMATH DE number 7204546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of quantified integer programming |
scientific article; zbMATH DE number 7204546 |
Statements
27 May 2020
0 references
integer programming
0 references
semi-linear sets
0 references
Presburger arithmetic
0 references
quantifier elimination
0 references
On the Complexity of Quantified Integer Programming (English)
0 references
0.8471198678016663
0 references
0.8409650921821594
0 references
0.8293724060058594
0 references
0.7914430499076843
0 references
0.7822338342666626
0 references
