Pages that link to "Item:Q5388017"

The following pages link to Computation of the Lasserre Ranks of Some Polytopes (Q5388017):

Displaying 15 items.

• Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
• Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
• An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
• Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
• Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
• Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
• Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← links)
• A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
• On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
• Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes (Q3009747) (← links)
• On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
• (Q5005186) (← links)
• (Q5091238) (← links)