Pages that link to "Item:Q5172724"
From MaRDI portal
The following pages link to CSP gaps and reductions in the lasserre hierarchy (Q5172724):
Displaying 35 items.
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← 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)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
- Fair colorful \(k\)-center clustering (Q2118132) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- A comprehensive analysis of polyhedral lift-and-project methods (Q2790405) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Hypercontractive inequalities via SOS, and the Frankl-Rödl graph (Q2826231) (← links)
- Guruswami-Sinop Rounding without Higher Level Lasserre (Q2969612) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846) (← links)
- Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy (Q3581430) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- From weak to strong linear programming gaps for all constraint satisfaction problems (Q4568111) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- Fair Colorful k-Center Clustering (Q5041747) (← links)
- (Q5089260) (← links)
- (Q5090427) (← links)
- (Q5090440) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- (Q5743406) (← links)
- (Q5743407) (← links)
- Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
