Pages that link to "Item:Q5757459"
From MaRDI portal
The following pages link to Extracting Randomness Using Few Independent Sources (Q5757459):
Displaying 32 items.
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences (Q987377) (← links)
- The sum-product theorem in \(\mathbb Z_q\) with \(q\) arbitrary (Q1001386) (← links)
- Improving the Hadamard extractor (Q1758168) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- Sparse affine-invariant linear codes are locally testable (Q2012176) (← links)
- Extracting randomness from extractor-dependent sources (Q2055613) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- No time to hash: on super-efficient entropy accumulation (Q2139648) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- A product theorem in free groups. (Q2445314) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one (Q2892669) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Increasing the output length of zero-error dispersers (Q3119044) (← links)
- Zero-Fixing Extractors for Sub-Logarithmic Entropy (Q3448797) (← links)
- From Affine to Two-Source Extractors via Approximate Duality (Q3451757) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators (Q3644215) (← links)
- Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs (Q4997309) (← links)
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
- (Q5090419) (← links)
- Optimal bounds for single-source Kolmogorov extractors (Q5217889) (← links)
- Growth in groups: ideas and perspectives (Q5254458) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
- NEW RESULTS ON SUM‐PRODUCT TYPE GROWTH OVER FIELDS (Q5376523) (← links)
- Proved Random Numbers Obtained from Hardware Devices (Q5415900) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
- Extractors and Lower Bounds for Locally Samplable Sources (Q5894225) (← links)
- Extractors in Paley graphs: a random model (Q5964262) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
