Pages that link to "Item:Q1039748"
From MaRDI portal
The following pages link to A note on upper bounds on the cp-rank (Q1039748):
Displaying 6 items.
- A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
- Computing symmetric nonnegative rank factorizations (Q651217) (← links)
- Building a completely positive factorization (Q1787912) (← links)
- Completely positive matrices: real, rational, and integral (Q1994053) (← links)
- Factorization of cp-rank-3 completely positive matrices (Q2828827) (← links)
- New results on the cp-rank and related properties of co(mpletely )positive matrices (Q2938346) (← links)
