Pages that link to "Item:Q344893"
From MaRDI portal
The following pages link to Matrices with high completely positive semidefinite rank (Q344893):
Displaying 11 items.
- Universal rigidity of complete bipartite graphs (Q517442) (← links)
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
- Completely positive semidefinite rank (Q1785204) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
- Correlation matrices, Clifford algebras, and completely positive semidefinite rank (Q5145555) (← links)
- Separability of Hermitian tensors and PSD decompositions (Q5888855) (← links)
- Approximate completely positive semidefinite factorizations and their ranks (Q6051147) (← links)
- Self-Dual Polyhedral Cones and Their Slack Matrices (Q6116664) (← links)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
