Pages that link to "Item:Q344517"
From MaRDI portal
The following pages link to A polynomial-time algorithm for computing low CP-rank decompositions (Q344517):
Displaying 4 items.
- A note on the computation of the CP-rank (Q854849) (← links)
- A simplex algorithm for rational cp-factorization (Q2020599) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)