The following pages link to (Q4527004):
Displaying 5 items.
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- New Strong Direct Product Results in Communication Complexity (Q2796407) (← links)
- Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)
