The following pages link to (Q4259979):
Displaying 9 items.
- Quantified maximum satisfiability (Q272016) (← links)
- A nonapproximability result for finite function generation (Q287157) (← links)
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← 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)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
