Polynomial time certifying algorithms for the planar quantified integer programming problem (Q2863168)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6231635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time certifying algorithms for the planar quantified integer programming problem |
scientific article; zbMATH DE number 6231635 |
Statements
Polynomial time certifying algorithms for the planar quantified integer programming problem (English)
0 references
21 November 2013
0 references
certifying algorithms
0 references
polynomial time
0 references
quantified integer programs
0 references
constraints
0 references
lattice points
0 references
0.7710585594177246
0 references
0.7518717646598816
0 references
0.7401795983314514
0 references
0.7326840758323669
0 references
0.7302709221839905
0 references
