Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471)

From MaRDI portal
Revision as of 13:18, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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

    Identifiers