Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? (Q5454254): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Outward rotations / rank | |||
Normal rank | |||
Revision as of 02:41, 29 February 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
