Multiplicative extractors for samplable distributions

Cites work

(Nondeterministic) hardness vs. non-malleability
A note on perfect correctness by derandomization
Decoding of Reed Solomon codes beyond the error-correction bound
Derandomization in Cryptography
Derandomizing Arthur-Merlin games using hitting sets
Extracting randomness from samplable distributions
Extracting randomness from samplable distributions, revisited
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
scientific article; zbMATH DE number 2019636 (Why is no real title available?)
scientific article; zbMATH DE number 1559537 (Why is no real title available?)
Improved Extractors for Recognizable and Algebraic Sources
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)
Low-End Uniform Hardness versus Randomness Tradeoffs for AM
Nearly optimal pseudorandomness from hardness
New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes.
Non-malleable codes with optimal rate for poly-size circuits
Nondeterministic direct product reductions and the success probability of SAT solvers
On the hardness of computing the permanent of random matrices
Overcoming weak expectations
Pseudorandom Generators and Typically-Correct Derandomization
Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
Pseudorandom generators without the XOR lemma
Pseudorandomness for approximate counting and sampling
Pseudorandomness when the odds are against you
Simple extractors for all min-entropies and a new pseudorandom generator
The journey from NP to TFNP hardness
Theory of Cryptography
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Weak derandomization of weak algorithms: explicit versions of Yao's lemma

This page was built for publication: Multiplicative extractors for samplable distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296773)