Pages that link to "Item:Q3088122"
From MaRDI portal
The following pages link to Efficient Probabilistically Checkable Debates (Q3088122):
Displaying 6 items.
- The complexity of debate checking (Q493647) (← links)
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← links)
- Credible debate equilibria (Q1823826) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Random Debaters and the Hardness of Approximating Stochastic Functions (Q4337648) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)