Tight Lower Bounds for the Complexity of Multicoloring (Q5205808)

From MaRDI portal
Revision as of 23:03, 13 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128121205, #quickstatements; #temporary_batch_1723585310344)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7143729
Language Label Description Also known as
English
Tight Lower Bounds for the Complexity of Multicoloring
scientific article; zbMATH DE number 7143729

    Statements

    Tight Lower Bounds for the Complexity of Multicoloring (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 December 2019
    0 references
    exponential time hypothesis
    0 references
    Kneser graph
    0 references
    detecting matrix
    0 references
    homomorphism
    0 references

    Identifiers

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