Simultaneous max-cut is harder to approximate than max-cut (Q5092456)
From MaRDI portal
scientific article; zbMATH DE number 7561737
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simultaneous max-cut is harder to approximate than max-cut |
scientific article; zbMATH DE number 7561737 |
Statements
21 July 2022
0 references
simultaneous CSPs
0 references
unique games hardness
0 references
max-cut
0 references
0 references
Simultaneous max-cut is harder to approximate than max-cut (English)
0 references
