Bounding the separable rank via polynomial optimization (Q2144234): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (5 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPA / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: JuMP / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSSOS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3201927314 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2109.14494 / rank | |||
Normal rank | |||
Latest revision as of 02:19, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding the separable rank via polynomial optimization |
scientific article |
Statements
Bounding the separable rank via polynomial optimization (English)
0 references
1 June 2022
0 references
entanglement
0 references
polynomial optimization
0 references
approximation hierarchies
0 references
matrix factorization ranks
0 references
completely positive rank
0 references
separable rank
0 references
