\(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes (Q1849443)
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: \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes |
scientific article; zbMATH DE number 1837072
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes |
scientific article; zbMATH DE number 1837072 |
Statements
\(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes (English)
0 references
1 December 2002
0 references
computational convexity
0 references
\(d\)-simplex
0 references
\(V\)-polytope
0 references
\(H\)-polytopes
0 references
\(\mathbb{N}\mathbb{P}\)-hardness
0 references
truncated simplex
0 references
