Towards Sharp Inapproximability for Any 2-CSP (Q3068639): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/070711670 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2789043785 / rank | |||
Normal rank |
Latest revision as of 21:59, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Towards Sharp Inapproximability for Any 2-CSP |
scientific article |
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