Optimal Bound on the Combinatorial Complexity of Approximating Polytopes (Q6058263)
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: Optimal Bound on the Combinatorial Complexity of Approximating Polytopes |
scientific article; zbMATH DE number 7758429
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Bound on the Combinatorial Complexity of Approximating Polytopes |
scientific article; zbMATH DE number 7758429 |
Statements
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes (English)
0 references
31 October 2023
0 references
polytope approximation
0 references
convex polytopes
0 references
macbeath regions
0 references
0.9618575572967528
0 references
0.920484185218811
0 references
0.9134596586227416
0 references
0.8614308834075928
0 references
0.8434485793113708
0 references
