On the construction of affine extractors

From MaRDI portal
Publication:879611

DOI10.1007/s00039-007-0593-zzbMath1115.68108OpenAlexW2064339630MaRDI QIDQ879611

Jean Bourgain

Publication date: 14 May 2007

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00039-007-0593-z




Related Items (27)

Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani SourcesZero-Fixing Extractors for Sub-Logarithmic EntropyFrom Affine to Two-Source Extractors via Approximate DualityDeterministic extractors for affine sources over large fieldsCorrelation bounds and \#SAT algorithms for small linear-size circuitsAffine extractors over large fields with exponential errorCorrelation Bounds and #SAT Algorithms for Small Linear-Size CircuitsA satisfiability algorithm and average-case hardness for formulas over the full binary basisExtractors for varietiesDeterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani SourcesOn secret sharing, randomness, and random-less reductions for secret sharingImproved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower BoundUnnamed ItemHow to get more mileage from randomness extractorsAffine extractors over prime fieldsTowards dimension expanders over finite fieldsIncreasing the Output Length of Zero-Error DispersersVariety evasive setsImproved Extractors for Recognizable and Algebraic SourcesAn Introduction to Randomness ExtractorsImproving the Hadamard extractorUnnamed ItemExtractors and Lower Bounds for Locally Samplable SourcesHow to extract useful randomness from unreliable sourcesAdditive Combinatorics: With a View Towards Computer Science and Cryptography—An ExpositionIncreasing the output length of zero-error dispersersNon-malleability against polynomial tampering




This page was built for publication: On the construction of affine extractors