Pages that link to "Item:Q3546310"
From MaRDI portal
The following pages link to Simple extractors for all min-entropies and a new pseudorandom generator (Q3546310):
Displayed 12 items.
- On derandomization and average-case complexity of monotone functions (Q428873) (← 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)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators (Q3644215) (← links)