Hardness of Approximate Hypergraph Coloring (Q3149889)

From MaRDI portal
Revision as of 05:08, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/siamcomp/GuruswamiHS02, #quickstatements; #temporary_batch_1731468600454)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Hardness of Approximate Hypergraph Coloring
scientific article

    Statements

    title
    Hardness of Approximate Hypergraph Coloring (English)
    0 references
    author
    Madhu Sudan
    0 references
    Venkatesan Guruswami
    0 references
    Johan T. Håstad
    0 references
    publication date
    29 September 2002
    0 references
    zbMATH Keywords
    graph coloring
    0 references
    hypergraph coloring
    0 references
    hardness of approximations
    0 references
    PCP
    0 references
    covering PCP
    0 references
    set splitting
    0 references

    Identifiers

    zbMATH DE Number
    1808497
    0 references
    Wikidata QID
    Q56958987
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3149889&oldid=37896713"
    Powered by MediaWiki