The following pages link to The complexity of debate checking (Q493647):
Displaying 8 items.
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← links)
- Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q2164756) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- Random Debaters and the Hardness of Approximating Stochastic Functions (Q4337648) (← links)
- (Q5232904) (← links)
- Debates with small transparent quantum verifiers (Q5890816) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q6077068) (← links)