Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness (Q3541788)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness |
scientific article |
Statements
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness (English)
0 references
27 November 2008
0 references
