The following pages link to (Q3002807):
Displaying 15 items.
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence (Q2102080) (← links)
- A parallel repetition theorem for entangled projection games (Q2351389) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- Arguments of Proximity (Q3457077) (← links)
- Compressing Interactive Communication Under Product Distributions (Q4637503) (← links)
- (Q4638090) (← links)
- Communication Complexity of Statistical Distance (Q5002655) (← links)
- (Q5002677) (← links)
- Anchored Parallel Repetition for Nonlocal Games (Q5067446) (← links)
- (Q5121905) (← 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)
- Flexible constrained de Finetti reductions and applications (Q5368663) (← links)