The complexity of facets (and some facets of complexity) (Q1061485)

From MaRDI portal
Revision as of 17:30, 14 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
The complexity of facets (and some facets of complexity)
scientific article

    Statements

    The complexity of facets (and some facets of complexity) (English)
    0 references
    1984
    0 references
    The authors introduce a certain complexity class \(D^ P\) connected with combinatorial optimization problems and in particular with the facets of polytopes. \(D^ P\) is the class of all languages that are the intersection of a language in NP and a language in coNP.
    0 references
    complexity class
    0 references
    combinatorial optimization
    0 references
    facets of polytopes
    0 references
    NP
    0 references
    coNP
    0 references

    Identifiers