On time complexity of semidefinite programs arising in polynomial optimization (Q2966411)
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: On time complexity of semidefinite programs arising in polynomial optimization |
scientific article; zbMATH DE number 6692426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On time complexity of semidefinite programs arising in polynomial optimization |
scientific article; zbMATH DE number 6692426 |
Statements
7 March 2017
0 references
0.8281113505363464
0 references
0.8260565400123596
0 references
0.7698297500610352
0 references
0.7670003771781921
0 references
0.7624033689498901
0 references
