Pages that link to "Item:Q2796404"
From MaRDI portal
The following pages link to Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404):
Displaying 50 items.
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- Some upper and lower bounds on PSD-rank (Q517316) (← links)
- Extension complexity of formal languages (Q778518) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- Extended formulations for order polytopes through network flows (Q1736010) (← links)
- Extension complexity and realization spaces of hypersimplices (Q1745198) (← links)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- Completely positive semidefinite rank (Q1785204) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- Multipartite quantum correlation and communication complexities (Q2012182) (← links)
- Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Extension complexity of the correlation polytope (Q2294265) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← 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)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- The rectangle covering number of random Boolean matrices (Q2363099) (← links)
- Boolean quadric polytopes are faces of linear ordering polytopes (Q2403680) (← 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)
- 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)
- The Parity Hamiltonian Cycle Problem in Directed Graphs (Q2835661) (← links)
- A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
- Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848) (← links)
- (Q3386630) (← links)
- (Q4568111) (← links)
- On Ranks of Regular Polygons (Q4594484) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- (Q4612478) (← links)
- Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs (Q4994984) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- On Polyhedral Approximations of the Positive Semidefinite Cone (Q5026447) (← links)
- Sparktope: linear programs from algorithms (Q5043848) (← links)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)
- (Q5089218) (← links)
- (Q5140843) (← links)
