Pages that link to "Item:Q2434987"

The following pages link to Some \(0/1\) polytopes need exponential size extended formulations (Q2434987):

Displaying 37 items.

• Extended formulations for sparsity matroids (Q304267) (← 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)
• On the nonnegative rank of distance matrices (Q436566) (← links)
• Extended formulations for polygons (Q714985) (← links)
• Smallest compact formulation for the permutahedron (Q745678) (← links)
• Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
• On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
• Extension complexity of formal languages (Q778518) (← links)
• Simple extensions of polytopes (Q896292) (← links)
• Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
• Affine reductions for LPs and SDPs (Q1717229) (← links)
• Extension complexity and realization spaces of hypersimplices (Q1745198) (← links)
• New limits of treewidth-based tractability in optimization (Q2118087) (← links)
• Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← 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 linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
• Theoretical insights and algorithmic tools for decision diagram-based optimization (Q2398513) (← links)
• On the extension complexity of scheduling polytopes (Q2661503) (← links)
• Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes (Q2670454) (← links)
• Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
• On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
• The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions (Q4592948) (← links)
• Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
• Extended formulations of lower-truncated transversal polymatroids (Q4999331) (← links)
• Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
• (Q5089218) (← links)
• On the complexity of computing a random Boolean function over the reals (Q5140843) (← links)
• Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
• No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
• Extended formulations in combinatorial optimization (Q5919994) (← links)
• Lifts for Voronoi cells of lattices (Q6050227) (← links)
• Shadows of Newton polytopes (Q6076195) (← links)
• On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096) (← links)