Pages that link to "Item:Q2913812"
From MaRDI portal
The following pages link to SDP gaps from pairwise independence (Q2913812):
Displaying 10 items.
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- Approximation resistant predicates from pairwise independence (Q626619) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- A comprehensive analysis of polyhedral lift-and-project methods (Q2790405) (← links)
- On the usefulness of predicates (Q2947573) (← links)
- From weak to strong linear programming gaps for all constraint satisfaction problems (Q4568111) (← links)
- Lower Bounds for CSP Refutation by SDP Hierarchies (Q4636475) (← links)
- Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs (Q4994984) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)