The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311)

From MaRDI portal
Revision as of 09:52, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
scientific article

    Statements

    The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (English)
    0 references
    0 references
    0 references
    5 May 1999
    0 references
    strong \({\mathcal P}\)-enumerability
    0 references
    computational complexity
    0 references

    Identifiers