Pages that link to "Item:Q2012178"
From MaRDI portal
The following pages link to Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178):
Displaying 10 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)
- 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)
- Natural proofs versus derandomization (Q2805512) (← links)
- (Q4472503) (← links)
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)