Local search is better than random assignment for bounded occurrence Ordering k-CSPs (Q2957878)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local search is better than random assignment for bounded occurrence Ordering k-CSPs |
scientific article |
Statements
30 January 2017
0 references
approximation algorithms
0 references
approximation resistance
0 references
ordering CSPs
0 references
Local search is better than random assignment for bounded occurrence Ordering k-CSPs (English)
0 references
