Pages that link to "Item:Q5470730"
From MaRDI portal
The following pages link to Extracting Randomness via Repeated Condensing (Q5470730):
Displaying 14 items.
- Variations on Muchnik's conditional complexity theorem (Q639853) (← links)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Constant time parallel sorting: An empirical view. (Q1401981) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- No time to hash: on super-efficient entropy accumulation (Q2139648) (← links)
- Santha-Vazirani sources, deterministic condensers and very strong extractors (Q2195575) (← links)
- Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
- Lossless condensers, unbalanced expanders, and extractors (Q2460624) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Big-Key Symmetric Encryption: Resisting Key Exfiltration (Q2835594) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- Loss-less condensers, unbalanced expanders, and extractors (Q5175962) (← links)
- Using Rademacher permutations to reduce randomness (Q5440793) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)