Pages that link to "Item:Q4606697"
From MaRDI portal
The following pages link to Extension Complexity of Independent Set Polytopes (Q4606697):
Displaying 22 items.
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- Extension complexity of stable set polytopes of bipartite graphs (Q1687905) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Extension complexity of the correlation polytope (Q2294265) (← links)
- On the extension complexity of scheduling polytopes (Q2661503) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- Small extended formulation for knapsack cover inequalities from monotone circuits (Q4612478) (← links)
- The Matching Polytope has Exponential Extension Complexity (Q4640350) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
- Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Expanding operators for the independent set problem (Q5263812) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
- Lifts for Voronoi cells of lattices (Q6050227) (← links)
- On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096) (← links)
