The solution of some random NP-hard problems in polynomial expected time (Q3031922)

From MaRDI portal
Revision as of 01:27, 3 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56324140, #quickstatements; #temporary_batch_1712101902020)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The solution of some random NP-hard problems in polynomial expected time
scientific article

    Statements

    The solution of some random NP-hard problems in polynomial expected time (English)
    0 references
    0 references
    0 references
    1989
    0 references
    graph partitioning
    0 references
    average-case complexity
    0 references
    NP-complete
    0 references
    Graph k- colourability
    0 references
    Small equitable cut
    0 references
    3-Partition
    0 references

    Identifiers