Computing the integer points of a polyhedron. II: Complexity estimates (Q1701489)
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: Computing the integer points of a polyhedron. II: Complexity estimates |
scientific article; zbMATH DE number 6842719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the integer points of a polyhedron. II: Complexity estimates |
scientific article; zbMATH DE number 6842719 |
Statements
Computing the integer points of a polyhedron. II: Complexity estimates (English)
0 references
23 February 2018
0 references
0.9775303602218628
0 references
0.8145636916160583
0 references
0.8064749240875244
0 references
0.79812091588974
0 references
0.7954257726669312
0 references
