On the combinatorial complexity of approximating polytopes (Q1688856): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59545298, #quickstatements; #temporary_batch_1708557319324 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:20, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the combinatorial complexity of approximating polytopes |
scientific article |
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
