The following pages link to Randomness in interactive proofs (Q1321030):
Displayed 4 items.
- 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)