Pages that link to "Item:Q3449458"

The following pages link to Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458):

Displaying 33 items.

• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
• Common information and unique disjointness (Q343843) (← links)
• Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
• On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
• Uncapacitated flow-based extended formulations (Q745688) (← links)
• Worst-case results for positive semidefinite rank (Q745690) (← links)
• Extension complexity of formal languages (Q778518) (← links)
• The matching problem has no small symmetric SDP (Q1675264) (← links)
• Affine reductions for LPs and SDPs (Q1717229) (← links)
• Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
• Strong reductions for extended formulations (Q1801022) (← links)
• Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• New limits of treewidth-based tractability in optimization (Q2118087) (← links)
• Extended formulations for radial cones (Q2294359) (← links)
• On polyhedral and second-order cone decompositions of semidefinite optimization problems (Q2294533) (← links)
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
• Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
• Approximate cone factorizations and lifts of polytopes (Q2349138) (← links)
• Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
• A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
• Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
• (Q3386630) (← links)
• Approximating Nonnegative Polynomials via Spectral Sparsification (Q4629345) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)
• A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
• Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs (Q4994984) (← links)
• No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
• An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610) (← links)
• A Polyhedral Characterization of Border Bases (Q5744696) (← links)
• Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
• Tighter bounds on transient moments of stochastic chemical systems (Q6182326) (← links)