Pages that link to "Item:Q5743610"
From MaRDI portal
The following pages link to An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610):
Displayed 13 items.
- Worst-case results for positive semidefinite rank (Q745690) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- Minimal positive realizations: A survey (Q2158979) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Fixed points of the EM algorithm and nonnegative rank boundaries (Q2338932) (← links)
- Exact solutions in low-rank approximation with zeros (Q2669183) (← links)
- Matrices of Bounded Psd Rank are Easy to Detect (Q4577739) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)
- Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory (Q5150834) (← links)
- (Q5214187) (← links)
- Nonnegative Matrix Factorization Requires Irrationality (Q5283249) (← links)
- Common Information, Noise Stability, and Their Extensions (Q5863763) (← links)