Pages that link to "Item:Q645124"
From MaRDI portal
The following pages link to Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124):
Displaying 12 items.
- The complexity of estimating min-entropy (Q260395) (← links)
- Arthur and Merlin as oracles (Q649095) (← links)
- Derandomizing Arthur-Merlin games using hitting sets (Q813315) (← 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)
- Pseudorandomness for approximate counting and sampling (Q2460030) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses (Q2819595) (← links)
- In a World of P=BPP (Q3088186) (← links)
- (Q4472503) (← links)
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)