A polynomial-time algorithm for computing low CP-rank decompositions (Q344517): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2016.09.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2016.09.004 / rank | |||
Normal rank | |||
Revision as of 00:11, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for computing low CP-rank decompositions |
scientific article |
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
