Affine extractors over prime fields

DOI10.1007/s00493-011-2604-9zbMath1249.11108OpenAlexW2087370750MaRDI QIDQ653998

Amir Yehudayoff

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2604-9

zbMATH Keywords

exponential sumaffine extractors

Mathematics Subject Classification ID

Estimates on exponential sums (11L07) Exponential sums (11T23)

Related Items (15)

Zero-Fixing Extractors for Sub-Logarithmic Entropy ⋮ From Affine to Two-Source Extractors via Approximate Duality ⋮ Correlation bounds and \#SAT algorithms for small linear-size circuits ⋮ Affine extractors over large fields with exponential error ⋮ Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits ⋮ A satisfiability algorithm and average-case hardness for formulas over the full binary basis ⋮ Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases ⋮ Improving \(3N\) circuit complexity lower bounds ⋮ Gate elimination: circuit size lower bounds and \#SAT upper bounds ⋮ An Introduction to Randomness Extractors ⋮ Improving the Hadamard extractor ⋮ Unnamed Item ⋮ Extractors and Lower Bounds for Locally Samplable Sources ⋮ How to extract useful randomness from unreliable sources ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition

Cites Work

• On the construction of affine extractors
• Multilinear exponential sums in prime fields under optimal entropy condition on the sources
• Deterministic extractors for affine sources over large fields
• Three XOR-Lemmas — An Exposition
• ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER

This page was built for publication: Affine extractors over prime fields