\(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes (Q1849443): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00454-002-0745-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026302893 / rank | |||
Normal rank | |||
Revision as of 18:09, 19 March 2024
scientific article
| 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 |
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
