Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? (Q5454254): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29030121, #quickstatements; #temporary_batch_1711234560214 |
Created claim: DBLP publication ID (P1635): journals/siamcomp/KhotKMO07, #quickstatements; #temporary_batch_1731483406851 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/KhotKMO07 / rank | |||
Normal rank | |||
Latest revision as of 09:29, 13 November 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
28 March 2008
0 references
MAX-CUT
0 references
Unique Games
0 references
hardness of approximation
0 references
constraint satisfaction
0 references
