Pages that link to "Item:Q5355204"
From MaRDI portal
The following pages link to The Complexity of Positive Semidefinite Matrix Factorization (Q5355204):
Displayed 11 items.
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Factoring a band matrix over a semiring (Q2041261) (← links)
- Bounding the separable rank via polynomial optimization (Q2144234) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices (Q3298903) (← links)
- Matrices of Bounded Psd Rank are Easy to Detect (Q4577739) (← links)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- Communication tasks in operational theories (Q5871091) (← links)