On the Complexity of Computing the Volume of a Polyhedron (Q3821581)

From MaRDI portal
Revision as of 09:16, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/siamcomp/DyerF88, #quickstatements; #temporary_batch_1731483406851)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
On the Complexity of Computing the Volume of a Polyhedron
scientific article

    Statements

    On the Complexity of Computing the Volume of a Polyhedron (English)
    0 references
    0 references
    0 references
    1988
    0 references
    computational complexity
    0 references
    {\#}P-easy
    0 references
    volume
    0 references
    polyhedron
    0 references
    convex hull
    0 references
    linear inequalities
    0 references
    {\#}P-hard
    0 references

    Identifiers