Pages that link to "Item:Q5355204"
From MaRDI portal
The following pages link to The Complexity of Positive Semidefinite Matrix Factorization (Q5355204):
Displaying 20 items.
- A new algorithm for positive semidefinite matrix completion (Q670219) (← links)
- 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)
- The complexity of tropical matrix factorization (Q2445938) (← links)
- A decomposition method for positive semidefinite matrices and its application to recursive parameter estimation (Q2706309) (← 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)
- The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems (Q6566472) (← links)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
- A practical algorithm with performance guarantees for the art gallery problem (Q6599806) (← links)
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
