Pages that link to "Item:Q5495786"

The following pages link to An information complexity approach to extended formulations (Q5495786):

Displaying 29 items.

• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
• Common information and unique disjointness (Q343843) (← links)
• Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
• Certifying equality with limited interaction (Q343864) (← links)
• Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
• Information lower bounds via self-reducibility (Q504999) (← links)
• On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
• Uncapacitated flow-based extended formulations (Q745688) (← links)
• Extensive form implementation in incomplete information environments (Q1268575) (← links)
• The matching problem has no small symmetric SDP (Q1675264) (← links)
• Affine reductions for LPs and SDPs (Q1717229) (← links)
• Extended formulations for vertex cover (Q1790198) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• Trading information complexity for error. II: The case of a large error and the external information complexity (Q2105437) (← links)
• On the streaming indistinguishability of a random permutation and a random function (Q2119020) (← links)
• Communication complexity with small advantage (Q2182866) (← links)
• Approximate cone factorizations and lifts of polytopes (Q2349138) (← links)
• A note on the extension complexity of the knapsack polytope (Q2450664) (← 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)
• (Q5121897) (← 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)
• The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
• (Q5875509) (← links)
• Complex psd-minimal polytopes in dimensions two and three (Q6089230) (← links)
• The work of Mark Braverman (Q6200321) (← links)