$(2+\varepsilon)$-Sat Is NP-hard (Q5363382)
From MaRDI portal
scientific article; zbMATH DE number 6786785
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | $(2+\varepsilon)$-Sat Is NP-hard |
scientific article; zbMATH DE number 6786785 |
Statements
$(2+\varepsilon)$-Sat Is NP-hard (English)
0 references
6 October 2017
0 references
constraint satisfaction
0 references
complexity dichotomy
0 references
discrepancy
0 references
hypergraph coloring
0 references
polymorphisms
0 references
probabilistically checkable proofs
0 references
