Pages that link to "Item:Q343843"

The following pages link to Common information and unique disjointness (Q343843):

Displaying 14 items.

• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← 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)
• Affine reductions for LPs and SDPs (Q1717229) (← links)
• Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
• A short proof that the extension complexity of the correlation polytope grows exponentially (Q2340413) (← links)
• Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
• Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
• Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
• Extension Complexity of Independent Set Polytopes (Q4606697) (← 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)
• Complex psd-minimal polytopes in dimensions two and three (Q6089230) (← links)