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):
Displaying 30 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- 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)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← 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)
- A modular framework for quantum-proof randomness extractors (Q2400201) (← 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)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Derandomization from Algebraic Hardness (Q5073523) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- (Q5092488) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- A Note on Perfect Correctness by Derandomization (Q5267419) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- (Q6084350) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)
