Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (Q5419137)
From MaRDI portal
scientific article; zbMATH DE number 6301191
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP |
scientific article; zbMATH DE number 6301191 |
Statements
Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (English)
0 references
5 June 2014
0 references
constant-time approximation
0 references
constraint satisfaction problems
0 references
linear programmings
0 references
property testing
0 references
rounding schemes
0 references
