Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145)
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: Near-optimal NP-hardness of approximating \textsc{Max} k-CSP_R |
scientific article; zbMATH DE number 7528579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) |
scientific article; zbMATH DE number 7528579 |
Statements
18 May 2022
0 references
Max-CSP
0 references
approximation algorithms
0 references
constraint satisfaction problems
0 references
hardness of approximation
0 references
unique games
0 references
dictatorship testing
0 references
non-Boolean domain
0 references
0 references
0 references
0.9380148649215698
0 references
0.8565600514411926
0 references
0.8525766134262085
0 references
0.8486177325248718
0 references
