Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/siamcomp/GuruswamiHMRC11, #quickstatements; #temporary_batch_1739530294150 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056590617 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/GuruswamiHMRC11 / rank | |||
Normal rank | |||
Latest revision as of 11:53, 14 February 2025
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
