Complexity of approximating CSP with balance / hard constraints (Q2988897): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Venkatesan Guruswami / rank | |||
| Property / author | |||
| Property / author: Venkatesan Guruswami / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2554797.2554837 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070622106 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of approximating CSP with balance / hard constraints |
scientific article |
Statements
Complexity of approximating CSP with balance / hard constraints (English)
0 references
19 May 2017
0 references
complexity dichotomy
0 references
constraint satisfaction problem
0 references
dictatorship testing
0 references
inapproximability
0 references
robust satisfiability
0 references
unique games conjecture
0 references
