On the combinatorial complexity of approximating polytopes (Q3132844)
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 combinatorial complexity of approximating polytopes |
scientific article; zbMATH DE number 6832268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the combinatorial complexity of approximating polytopes |
scientific article; zbMATH DE number 6832268 |
Statements
30 January 2018
0 references
polytope approximation
0 references
convex polytopes
0 references
Macbeath regions
0 references
0.995801568031311
0 references
0.8380492925643921
0 references
0.8185042142868042
0 references
0.8057854175567627
0 references
