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 7 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)
- Query-Efficient Dictatorship Testing with Perfect Completeness (Q4933378) (← links)
- An improved derandomized approximation algorithm for the max-controlled set problem (Q5198931) (← links)
- Cones of multipowers and combinatorial optimization problems (Q5413066) (← links)
- (Q5497122) (← links)