Pages that link to "Item:Q517316"
From MaRDI portal
The following pages link to Some upper and lower bounds on PSD-rank (Q517316):
Displaying 14 items.
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Worst-case results for positive semidefinite rank (Q745690) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- Two results on the size of spectrahedral descriptions (Q2792406) (← links)
- A Lower Bound on the Positive Semidefinite Rank of Convex Bodies (Q4564016) (← links)
- Matrices of Bounded Psd Rank are Easy to Detect (Q4577739) (← links)
- Communication of partial ignorance with qubits (Q5059074) (← links)
- The Phaseless Rank of a Matrix (Q5157584) (← links)
- Communication tasks in operational theories (Q5871091) (← links)
- Complex psd-minimal polytopes in dimensions two and three (Q6089230) (← links)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
