Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Venkatesan Guruswami / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Johan T. Håstad / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Moses Charikar / rank | |||
Normal rank | |||
Revision as of 18:33, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant |
scientific article |
Statements
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (English)
0 references
18 October 2011
0 references
maximum acyclic subgraph
0 references
feedback arc set
0 references
unique games conjecture
0 references
hardness of approximation
0 references
integrality gaps
0 references
