Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems (Q3499775)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems |
scientific article |
Statements
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems (English)
0 references
3 June 2008
0 references
maximum constraint satisfaction
0 references
complexity
0 references
approximability
0 references
