Complexity of approximating CSP with balance/hard constraints (Q315529)
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: Complexity of approximating CSP with balance/hard constraints |
scientific article; zbMATH DE number 6628965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of approximating CSP with balance/hard constraints |
scientific article; zbMATH DE number 6628965 |
Statements
Complexity of approximating CSP with balance/hard constraints (English)
0 references
21 September 2016
0 references
constraint satisfaction problems
0 references
complexity dichotomy
0 references
approximation algorithms
0 references
hardness of approximation
0 references
unique games hardness
0 references
0 references
0 references
0 references
0 references
0.9935086965560912
0 references
0.8306485414505005
0 references
0.8284367322921753
0 references
0.8201022744178772
0 references
