Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:03, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces |
scientific article |
Statements
Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (English)
0 references
22 August 1993
0 references
polynomial-time algorithms
0 references
computational geometry
0 references
ellipsoid method
0 references
sensitivity analysis
0 references
convex body
0 references
polarity
0 references
polytope
0 references
breadth,
0 references
width
0 references
diameter
0 references
radius
0 references
insphere
0 references
circumsphere
0 references
\(n\)-dimensional convex polytope
0 references
NP-hardness
0 references
