The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250)

From MaRDI portal
Revision as of 23:40, 18 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7045104
Language Label Description Also known as
English
The complexity of approximating PSPACE-complete problems for hierarchical specifications
scientific article; zbMATH DE number 7045104

    Statements

    The complexity of approximating PSPACE-complete problems for hierarchical specifications (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2019
    0 references
    vertex cover
    0 references
    maximal match
    0 references
    super node
    0 references
    vertex cover problem
    0 references
    minimum vertex cover
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references