\((2+\varepsilon)\)-Sat is NP-hard (Q5363382)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6786785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8394383788108826
0 references
0.8024108409881592
0 references
0.7933349013328552
0 references
