Pages that link to "Item:Q2341256"
From MaRDI portal
The following pages link to An upper bound for nonnegative rank (Q2341256):
Displayed 20 items.
- Extended formulations for convex heptagons (Q265972) (← links)
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Common information and unique disjointness (Q343843) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- Tropical lower bounds for extended formulations (Q745680) (← links)
- Worst-case results for positive semidefinite rank (Q745690) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- Extension complexity and realization spaces of hypersimplices (Q1745198) (← links)
- Hidden vertices in extensions of polytopes (Q1785631) (← links)
- Lifts of non-compact convex sets and cone factorizations (Q2220437) (← links)
- Polygons as sections of higher-dimensional polytopes (Q2256121) (← links)
- An elementary method to compute the algebra generated by some given matrices and its dimension (Q2419013) (← links)
- Symmetric nonnegative matrix trifactorization (Q2693700) (← links)
- (Q2808527) (← links)
- Extension Complexity of Polytopes with Few Vertices or Facets (Q2835841) (← links)
- Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
- Studying Non-negative Factorizations with Tools from Linear Algebra over a Semiring (Q3448302) (← links)
- On Ranks of Regular Polygons (Q4594484) (← links)
- A separation between tropical matrix ranks (Q5055609) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)