Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471)
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: Polynomial-time approximation of largest simplices in \(V\)-polytopes. |
scientific article; zbMATH DE number 2032817
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time approximation of largest simplices in \(V\)-polytopes. |
scientific article; zbMATH DE number 2032817 |
Statements
Polynomial-time approximation of largest simplices in \(V\)-polytopes. (English)
0 references
26 January 2004
0 references
Containment problems
0 references
Simplex
0 references
Crosspolytope
0 references
Determinant
0 references
Inapproximability
0 references
Polynomial-time
0 references
Approximation algorithm
0 references
Computational complexity
0 references
\(\mathbb{NP}\)-hardness
0 references
0 references
0 references
0 references
0 references
