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):
Displayed 5 items.
- The complexity of estimating min-entropy (Q260395) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- In a World of P=BPP (Q3088186) (← links)
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)