The UGC hardness threshold of the \(L_{p}\) Grothendieck problem (Q3169093)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The UGC hardness threshold of the L_p Grothendieck problem |
scientific article; zbMATH DE number 5881689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The UGC hardness threshold of the \(L_{p}\) Grothendieck problem |
scientific article; zbMATH DE number 5881689 |
Statements
The UGC Hardness Threshold of the <i>L<sub>p</sub></i> Grothendieck Problem (English)
0 references
27 April 2011
0 references
quadratic programming
0 references
approximation algorithms
0 references
unique games hardness
0 references
0.9957756996154784
0 references
0.7753787636756897
0 references
0.7681955695152283
0 references
0.7650531530380249
0 references
