Extractors for varieties

DOI10.1007/s00037-011-0023-3zbMath1280.68293OpenAlexW2177895384MaRDI QIDQ1926108

Zeev Dvir

Publication date: 27 December 2012

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-011-0023-3

zbMATH Keywords

algebraic geometrydeterministic extractors

Mathematics Subject Classification ID

Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (12)

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits ⋮ Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources ⋮ Affine extractors over large fields with exponential error ⋮ Exponential sums over points of elliptic curves ⋮ Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Improving \(3N\) circuit complexity lower bounds ⋮ Unnamed Item ⋮ Gate elimination: circuit size lower bounds and \#SAT upper bounds ⋮ Improved Extractors for Recognizable and Algebraic Sources ⋮ Algebraic independence in positive characteristic: A $p$-adic calculus ⋮ Non-malleability against polynomial tampering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extractors and rank extractors for polynomial sources
• On the construction of affine extractors
• Equations over finite fields. An elementary approach
• Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz
• La conjecture de Weil. I
• A note on simultaneous congruences
• Deterministic extractors for affine sources over large fields
• 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
• Three XOR-Lemmas — An Exposition
• How to get more mileage from randomness extractors
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Minimum distance bounds for cyclic codes and Deligne's theorem
• Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
• On Exponential Sums in Finite Fields
• Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
• Deterministic extractors for small-space sources
• Public Key Cryptography - PKC 2006

This page was built for publication: Extractors for varieties