Pages that link to "Item:Q2941493"

The following pages link to Sum of Squares Lower Bounds from Pairwise Independence (Q2941493):

Displaying 11 items.

• Cryptographic hardness of random local functions. Survey (Q332271) (← links)
• An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
• Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
• Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
• On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← 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)
• (Q5090427) (← links)
• (Q5090440) (← links)
• No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
• (Q6062142) (← links)