Lower bounds on the size of semidefinite programming relaxations (Q2941550)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6474760
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds on the size of semidefinite programming relaxations |
scientific article; zbMATH DE number 6474760 |
Statements
Lower Bounds on the Size of Semidefinite Programming Relaxations (English)
0 references
21 August 2015
0 references
approximation complexity
0 references
lower bounds on positive-semidefinite rank
0 references
polynomial optimization
0 references
quantum learning
0 references
semidefinite programming
0 references
sum-of-squares method
0 references
0 references
0.8577955365180969
0 references
0.8294139504432678
0 references
0.8248062133789062
0 references
0.8177523612976074
0 references
0.8163118958473206
0 references
