Improved Extractors for Recognizable and Algebraic Sources
From MaRDI portal
Cites work
- Class of constructive asymptotically good algebraic codes
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Deterministic extractors for small-space sources
- Extractors and rank extractors for polynomial sources
- Extractors for varieties
- Extractors with weak random seeds
- Generating quasi-random sequences from semi-random sources
- Hard functions for low-degree polynomials over prime fields
- scientific article; zbMATH DE number 524134 (Why is no real title available?)
- Improved average-case lower bounds for De Morgan formula size: matching worst-case lower bound
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- On the construction of affine extractors
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds
- Randomness is linear in space
- Three XOR-lemmas -- an exposition
- Two structural results for low degree polynomials and applications
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma
- Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds
Cited in
(5)
This page was built for publication: Improved Extractors for Recognizable and Algebraic Sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875532)
