The following pages link to Real rank versus nonnegative rank (Q1039742):
Displayed 22 items.
- Extended formulations for convex heptagons (Q265972) (← links)
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- On the nonnegative rank of distance matrices (Q436566) (← links)
- Tropical patterns of matrices and the Gondran-Minoux rank function (Q445842) (← links)
- Semi-nonnegative rank for real matrices and its connection to the usual rank (Q472415) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- On the nonnegative rank of Euclidean distance matrices (Q977487) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression (Q2174096) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Nonnegative rank factorization -- a heuristic approach via rank reduction (Q2248962) (← links)
- Polygons as sections of higher-dimensional polytopes (Q2256121) (← links)
- An upper bound for nonnegative rank (Q2341256) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Symmetric nonnegative matrix trifactorization (Q2693700) (← links)
- Extension Complexity of Polytopes with Few Vertices or Facets (Q2835841) (← links)
- Nonnegative rank of a matrix with one negative eigenvalue (Q2938329) (← links)
- Studying Non-negative Factorizations with Tools from Linear Algebra over a Semiring (Q3448302) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)
- Common Information, Noise Stability, and Their Extensions (Q5863763) (← links)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)