On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems (Q2851846)
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 6213488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems |
scientific article; zbMATH DE number 6213488 |
Statements
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems (English)
0 references
4 October 2013
0 references
0.9979538
0 references
0.90954196
0 references
0.9031999
0 references
0.9029003
0 references
0.90135646
0 references
0.8993274
0 references
0.89871836
0 references
0.8958434
0 references
