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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q29030121, #quickstatements; #temporary_batch_1711234560214
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Outward rotations / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q29030121 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:14, 24 March 2024

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