Pages that link to "Item:Q2460030"
From MaRDI portal
The following pages link to Pseudorandomness for approximate counting and sampling (Q2460030):
Displaying 14 items.
- The complexity of estimating min-entropy (Q260395) (← links)
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Arthur and Merlin as oracles (Q649095) (← links)
- Relations between average-case and worst-case complexity (Q927398) (← links)
- Sparse selfreducible sets and nonuniform lower bounds (Q1755786) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- On the de-randomization of space-bounded approximate counting problems (Q2348703) (← links)
- On zero error algorithms having oracle access to one query (Q2498984) (← links)
- Arthur and Merlin as Oracles (Q3599130) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)
