Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope
scientific article

    Statements

    Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (English)
    0 references
    0 references
    29 January 2010
    0 references
    computational complexity
    0 references
    computational geometry
    0 references
    inapproximability
    0 references
    parameterized computation
    0 references

    Identifiers