Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56958820, #quickstatements; #temporary_batch_1705020570124 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:48, 3 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
