Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems (Q3499775)
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 5282058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems |
scientific article; zbMATH DE number 5282058 |
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
0.9133664965629578
0 references
0.8627362847328186
0 references
0.8502116799354553
0 references
0.8497428297996521
0 references
