Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:45, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time approximation of largest simplices in \(V\)-polytopes. |
scientific article |
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
