Pages that link to "Item:Q4337648"
From MaRDI portal
The following pages link to Random Debaters and the Hardness of Approximating Stochastic Functions (Q4337648):
Displaying 7 items.
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← links)
- Trainyard is NP-hard (Q1623273) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- (Q2741527) (← links)
- A PCP Characterization of AM (Q3012834) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
