Pages that link to "Item:Q2835841"
From MaRDI portal
The following pages link to Extension complexity of polytopes with few vertices or facets (Q2835841):
Displaying 15 items.
- Extended formulations for polygons (Q714985) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
- Extension complexity and realization spaces of hypersimplices (Q1745198) (← links)
- Hidden vertices in extensions of polytopes (Q1785631) (← links)
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres (Q2197688) (← links)
- Extension complexities of Cartesian products involving a pyramid (Q2404613) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
- The Matching Polytope has Exponential Extension Complexity (Q4640350) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)
- Complex psd-minimal polytopes in dimensions two and three (Q6089230) (← links)
- On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096) (← links)