Lower Bounds on the Size of Semidefinite Programming Relaxations (Q2941550): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Graphs / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031923588 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1411.6317 / rank | |||
Normal rank | |||
Latest revision as of 11:12, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower Bounds on the Size of Semidefinite Programming Relaxations |
scientific article |
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
