On the combinatorial complexity of approximating polytopes (Q1688856)
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 6824883
| 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 6824883 |
Statements
On the combinatorial complexity of approximating polytopes (English)
0 references
11 January 2018
0 references
convex polytopes
0 references
polytope approximation
0 references
combinatorial complexity
0 references
macbeath regions
0 references
0 references
0.995801568031311
0 references
0.837173342704773
0 references
0.8146288394927979
0 references
0.8111841082572937
0 references
