Pages that link to "Item:Q2941494"
From MaRDI portal
The following pages link to Inapproximability of Combinatorial Problems via Small LPs and SDPs (Q2941494):
Displaying 9 items.
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- A Polyhedral Characterization of Border Bases (Q5744696) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
