Pages that link to "Item:Q4978005"
From MaRDI portal
The following pages link to Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs (Q4978005):
Displaying 21 items.
- Random oracles and non-uniformity (Q1648794) (← 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)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- (Q4568111) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- (Q5009548) (← links)
- On Polyhedral Approximations of the Positive Semidefinite Cone (Q5026447) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- (Q5088887) (← links)
- (Q5089260) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- (Q5121903) (← links)
- (Q5158503) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
