Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077)

From MaRDI portal
Revision as of 16:35, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references