SDP gaps and UGC-hardness for max-cut-gain (Q3002802)
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: SDP gaps and UGC-hardness for max-cut-gain |
scientific article; zbMATH DE number 5899277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SDP gaps and UGC-hardness for max-cut-gain |
scientific article; zbMATH DE number 5899277 |
Statements
24 May 2011
0 references
max-cut
0 references
max-cut-gain
0 references
semidefinite programming
0 references
semidefinite programming gaps
0 references
unique games conjecture
0 references
dictator testing
0 references
Gaussian space
0 references
quadratic programming
0 references
Grothendieck inequality
0 references
Fourier analysis
0 references
0.8407219052314758
0 references
0.8246026635169983
0 references
0.8220661282539368
0 references
0.821600615978241
0 references
0.819171667098999
0 references
