Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? (Q5454254)

From MaRDI portal
Revision as of 02:14, 24 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29030121, #quickstatements; #temporary_batch_1711234560214)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5255553
Language Label Description Also known as
English
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
scientific article; zbMATH DE number 5255553

    Statements

    Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 March 2008
    0 references
    0 references
    MAX-CUT
    0 references
    Unique Games
    0 references
    hardness of approximation
    0 references
    constraint satisfaction
    0 references
    0 references