Hardness of Approximate Hypergraph Coloring (Q3149889)

From MaRDI portal
Revision as of 17:46, 31 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
Hardness of Approximate Hypergraph Coloring
scientific article

    Statements

    title
    Hardness of Approximate Hypergraph Coloring (English)
    0 references
    author
    Venkatesan Guruswami
    0 references
    Q194336
    0 references
    Madhu Sudan
    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
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3149889&oldid=3477660"
      Powered by MediaWiki