Pages that link to "Item:Q1759811"
From MaRDI portal
The following pages link to Combinatorial bounds on nonnegative rank and extended formulations (Q1759811):
Displayed 43 items.
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- Extended formulations for independence polytopes of regular matroids (Q343749) (← links)
- Common information and unique disjointness (Q343843) (← links)
- Sparse sums of squares on finite abelian groups and improved semidefinite lifts (Q344935) (← links)
- Polytopes of minimum positive semidefinite rank (Q377501) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- Extended formulations for polygons (Q714985) (← links)
- Smallest compact formulation for the permutahedron (Q745678) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Worst-case results for positive semidefinite rank (Q745690) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- Fooling sets and the spanning tree polytope (Q1705643) (← links)
- Extension complexity and realization spaces of hypersimplices (Q1745198) (← links)
- A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
- Factoring a band matrix over a semiring (Q2041261) (← links)
- Nonnegative rank depends on the field (Q2227545) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- Fooling-sets and rank (Q2346587) (← links)
- Small extended formulations for cyclic polytopes (Q2351019) (← links)
- The rectangle covering number of random Boolean matrices (Q2363099) (← links)
- The (minimum) rank of typical fooling-set matrices (Q2399380) (← links)
- On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165) (← links)
- On the complexity of Boolean matrix ranks (Q2435409) (← links)
- Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes (Q2670454) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- Extension Complexity of Polytopes with Few Vertices or Facets (Q2835841) (← links)
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
- The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract) (Q2971660) (← links)
- Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848) (← links)
- Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
- The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions (Q4592948) (← links)
- Extended formulations of lower-truncated transversal polymatroids (Q4999331) (← links)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)
- On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
- Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization (Q5742692) (← links)
- Lifts for Voronoi cells of lattices (Q6050227) (← links)
- On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096) (← links)