The resolution complexity of independent sets and vertex covers in random graphs (Q2474203)

From MaRDI portal
Revision as of 00:54, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The resolution complexity of independent sets and vertex covers in random graphs
scientific article

    Statements

    The resolution complexity of independent sets and vertex covers in random graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 March 2008
    0 references
    resolution proof
    0 references
    proof complexity
    0 references
    hardness of approximation
    0 references
    independent set
    0 references
    vertex cover
    0 references

    Identifiers

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