Pages that link to "Item:Q3225175"
From MaRDI portal
The following pages link to Parallel Repetition in Projection Games and a Concentration Bound (Q3225175):
Displaying 13 items.
- Information complexity and applications. (Q1731897) (← links)
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence (Q2102080) (← links)
- Perfect strategies for non-local games (Q2310480) (← links)
- (Q4638072) (← links)
- Communication Complexity of Statistical Distance (Q5002655) (← links)
- (Q5002677) (← links)
- Imperfect gaps in Gap-ETH and PCPs (Q5091784) (← links)
- Dimension Reduction for Polynomials over Gaussian Space and Applications (Q5121916) (← links)
- Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)
- Optimality of Correlated Sampling Strategies (Q5140847) (← links)
- (Q5158500) (← links)
- Max-3-Lin over non-abelian groups with universal factor graphs (Q6053470) (← links)
- Communication and information complexity (Q6200329) (← links)
