The following pages link to (Q4472503):
Displaying 8 items.
- Derandomizing Arthur-Merlin games using hitting sets (Q813315) (← links)
- Randomization, derandomization and antirandomization: Three games (Q1331937) (← links)
- Derandomizing Arthur-Merlin games under uniform assumptions (Q1601037) (← links)
- Uniform hardness versus randomness tradeoffs for Arthur-Merlin games (Q1762663) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses (Q2819595) (← links)
- New Computational Paradigms (Q5717081) (← links)
- Easiness assumptions and hardness tests: Trading time for zero error (Q5956013) (← links)