scientific article; zbMATH DE number 1256744
From MaRDI portal
Publication:4228480
Recommendations
Cited in
(22)- Extracting randomness: A survey and new constructions
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
- How to extract useful randomness from unreliable sources
- Computational depth: Concept and applications
- Extractors from Reed-Muller codes
- Device-independent Randomness Extraction for Arbitrarily Weak Min-entropy Source.
- Kakeya sets, new mergers, and old extractors
- Local correlation breakers and applications to three-source extractors and mergers
- Analyzing linear mergers
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators
- Computing with Very Weak Random Sources
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Extractors for weak random sources and their applications
- Optimal coin flipping
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Deterministic extractors for small-space sources
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Coalgebraic tools for randomness-conserving protocols
- Lower bounds for planar arithmetic circuits
- Randomness extractors in AC^0 and NC^1: optimal up to constant factors
- Lower bounds for planar arithmetic circuits
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228480)
