Pages that link to "Item:Q2294265"
From MaRDI portal
The following pages link to Extension complexity of the correlation polytope (Q2294265):
Displaying 7 items.
- Correlation polytopes: Their geometry and complexity (Q1176573) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- A short proof that the extension complexity of the correlation polytope grows exponentially (Q2340413) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- The Complexity of Problems in P Given Correlated Instances (Q4638062) (← links)
- Extension Complexity, MSO Logic, and Treewidth (Q5369520) (← links)