Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476)
From MaRDI portal
scientific article; zbMATH DE number 7650091
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder |
scientific article; zbMATH DE number 7650091 |
Statements
3 February 2023
0 references
constraint satisfaction problems
0 references
global cardinality constraints
0 references
semidefinite programming
0 references
inapproximability
0 references
unique games conjecture
0 references
max-cut
0 references
max-2-sat
0 references
Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (English)
0 references
0 references
0 references
