Towards sharp inapproximability for any 2-CSP (Q3068639)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Towards sharp inapproximability for any 2-CSP |
scientific article; zbMATH DE number 5837595
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards sharp inapproximability for any 2-CSP |
scientific article; zbMATH DE number 5837595 |
Statements
Towards Sharp Inapproximability for Any 2-CSP (English)
0 references
17 January 2011
0 references
constraint satisfaction problems
0 references
approximation algorithms
0 references
unique games conjecture
0 references
semidefinite programming
0 references
CSP
0 references
0.8665213584899902
0 references
0.8613552451133728
0 references
0.8379061222076416
0 references
0.8361450433731079
0 references
0.8344824314117432
0 references
