Pages that link to "Item:Q4640350"
From MaRDI portal
The following pages link to The Matching Polytope has Exponential Extension Complexity (Q4640350):
Displaying 50 items.
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- Extended formulations for independence polytopes of regular matroids (Q343749) (← links)
- Common information and unique disjointness (Q343843) (← links)
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- Some upper and lower bounds on PSD-rank (Q517316) (← links)
- On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs (Q527446) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
- Extension complexity of formal languages (Q778518) (← links)
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Extension complexity and realization spaces of hypersimplices (Q1745198) (← links)
- Circuit and bond polytopes on series-parallel graphs (Q1751117) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
- Alternating conditional gradient method for convex feasibility problems (Q2044579) (← links)
- Individual and cooperative portfolio optimization as linear program (Q2091212) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Cuts in undirected graphs. II (Q2215853) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Extended formulations for radial cones (Q2294359) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- Compact linear programs for 2SAT (Q2311345) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
- The slack realization space of a matroid (Q2316680) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← 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)
- Theoretical insights and algorithmic tools for decision diagram-based optimization (Q2398513) (← links)
- Erdős-Ko-Rado for perfect matchings (Q2400976) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
