Pages that link to "Item:Q745683"
From MaRDI portal
The following pages link to On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683):
Displaying 7 items.
- Extension complexity of formal languages (Q778518) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- (Q5140843) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
