The following pages link to Extended formulations for polygons (Q714985):
Displaying 26 items.
- Extended formulations for convex heptagons (Q265972) (← links)
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Common information and unique disjointness (Q343843) (← links)
- Polytopes of minimum positive semidefinite rank (Q377501) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- Realizability of polytopes as a low rank matrix completion problem (Q741602) (← links)
- Tropical lower bounds for extended formulations (Q745680) (← links)
- On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
- Worst-case results for positive semidefinite rank (Q745690) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- Extension complexity and realization spaces of hypersimplices (Q1745198) (← links)
- Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (Q1789594) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Polygons as sections of higher-dimensional polytopes (Q2256121) (← links)
- An upper bound for nonnegative rank (Q2341256) (← links)
- Small extended formulations for cyclic polytopes (Q2351019) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes (Q2670454) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Computing a Nonnegative Matrix Factorization---Provably (Q2817794) (← 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)
- Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)
- On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096) (← links)
