Pages that link to "Item:Q513256"
From MaRDI portal
The following pages link to On the linear extension complexity of regular \(n\)-gons (Q513256):
Displaying 9 items.
- Extended formulations for convex heptagons (Q265972) (← links)
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- 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)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
- On Ranks of Regular Polygons (Q4594484) (← links)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)