A polynomial-time algorithm for computing low CP-rank decompositions (Q344517)
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 6655339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for computing low CP-rank decompositions |
scientific article; zbMATH DE number 6655339 |
Statements
A polynomial-time algorithm for computing low CP-rank decompositions (English)
0 references
23 November 2016
0 references
completely positive matrix
0 references
CP-rank
0 references
CP-decomposition
0 references
polynomial-time algorithm
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0 references
0.86759794
0 references
0.8672884
0 references
0.8671534
0 references
0.8619038
0 references
0.8589329
0 references
0.8579705
0 references
0.85478824
0 references
0.8540968
0 references
0.8533246
0 references
