Pages that link to "Item:Q1702780"
From MaRDI portal
The following pages link to Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780):
Displaying 10 items.
- On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
- Maximal averages over linear and monomial polyhedra (Q838413) (← links)
- A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
- A variational principle for ground spaces (Q2194218) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- On polyhedral extension of some LP theorems (Q3683895) (← links)
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM (Q5151087) (← links)
- Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization (Q5742692) (← links)
- On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096) (← links)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
