The following pages link to Randomness in interactive proofs (Q1321030):
Displaying 14 items.
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Derandomized graph products (Q1842777) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Interactive Coding for Interactive Proofs (Q2799101) (← links)
- A PCP Characterization of AM (Q3012834) (← links)
- A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
- Another Motivation for Reducing the Randomness Complexity of Algorithms (Q3088202) (← links)
- Randomness-efficient non-interactive zero knowledge (Q4572000) (← links)
- (Q5009546) (← links)
- Simple Optimal Hitting Sets for Small-Success RL (Q5115702) (← links)
- (Q5875519) (← links)
