Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077)
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: Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces |
scientific article; zbMATH DE number 279316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces |
scientific article; zbMATH DE number 279316 |
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
0.9156663417816162
0 references
0.8782477974891663
0 references
0.7850279211997986
0 references
