Pages that link to "Item:Q745682"
From MaRDI portal
The following pages link to On the extension complexity of combinatorial polytopes (Q745682):
Displaying 23 items.
- Common information and unique disjointness (Q343843) (← links)
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
- Extension complexity of formal languages (Q778518) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Extended formulations for radial cones (Q2294359) (← links)
- Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
- A short proof that the extension complexity of the correlation polytope grows exponentially (Q2340413) (← links)
- A generalization of extension complexity that captures P (Q2345857) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
- On the extension complexity of scheduling polytopes (Q2661503) (← links)
- The last dozen of years of or research in Czechia and Slovakia (Q2673270) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- (Q3386630) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- (Q5326550) (redirect page) (← links)
