Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q6289805)
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: Lower bounds on matrix factorization ranks via noncommutative polynomial optimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on matrix factorization ranks via noncommutative polynomial optimization |
scientific article |
Statements
4 August 2017
0 references
math.OC
0 references
