Pages that link to "Item:Q3579218"
From MaRDI portal
The following pages link to On the power of unique 2-prover 1-round games (Q3579218):
Displayed 24 items.
- Approximating Single Machine Scheduling with Scenarios (Q3541793) (← links)
- Hardness of robust network design (Q3593369) (← links)
- More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP (Q3608306) (← links)
- (Q4568111) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- Query-Efficient Dictatorship Testing with Perfect Completeness (Q4933378) (← links)
- (Q5111746) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- An improved derandomized approximation algorithm for the max-controlled set problem (Q5198931) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
- Nearly Optimal NP-Hardness of Unique Coverage (Q5269824) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- $(2+\varepsilon)$-Sat Is NP-hard (Q5363382) (← links)
- Cones of multipowers and combinatorial optimization problems (Q5413066) (← links)
- (Q5497122) (← links)
- (Q5500595) (← links)
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953) (← links)
- (Q5741631) (← links)
- (Q5743380) (← links)
- (Q5743408) (← links)
- (Q5743431) (← links)
- (Q5743433) (← links)