The following pages link to Extractors (Q3581258):
Displaying 19 items.
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- An optimal lower bound for 2-query locally decodable linear codes (Q1045948) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- A modular framework for quantum-proof randomness extractors (Q2400201) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Increasing the output length of zero-error dispersers (Q3119044) (← links)
- Local Correlation Breakers and Applications to Three-Source Extractors and Mergers (Q3187171) (← links)
- Analyzing linear mergers (Q3503607) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- (Q5091780) (← links)
- On ε‐biased generators in NC<sup>0</sup> (Q5486308) (← links)
- Lower bounds for adaptive locally decodable codes (Q5704840) (← links)
- Extractor Lower Bounds, Revisited (Q6084344) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
