Pages that link to "Item:Q1601037"
From MaRDI portal
The following pages link to Derandomizing Arthur-Merlin games under uniform assumptions (Q1601037):
Displaying 17 items.
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Arthur and Merlin as oracles (Q649095) (← links)
- Derandomizing Arthur-Merlin games using hitting sets (Q813315) (← links)
- Randomization, derandomization and antirandomization: Three games (Q1331937) (← links)
- Uniform hardness versus randomness tradeoffs for Arthur-Merlin games (Q1762663) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- A zero-one law for RP and derandomization of AM if NP is not small (Q2389331) (← links)
- Pseudorandomness for approximate counting and sampling (Q2460030) (← links)
- Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses (Q2819595) (← links)
- (Q4472503) (← links)
- Fine-grained derandomization: from problem-centric to resource-centric complexity (Q5002697) (← links)
- NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES (Q5714674) (← links)
- New Computational Paradigms (Q5717081) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- Easiness assumptions and hardness tests: Trading time for zero error (Q5956013) (← links)
- Constructive separations and their consequences (Q6566463) (← links)