Extractors and rank extractors for polynomial sources
From MaRDI portal
Publication:626610
DOI10.1007/s00037-009-0258-4zbMath1210.68136OpenAlexW1983595405MaRDI QIDQ626610
Zeev Dvir, Avi Wigderson, Ariel Gabizon
Publication date: 18 February 2011
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-009-0258-4
Related Items (22)
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 ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Affine extractors over large fields with exponential error ⋮ Extractors for varieties ⋮ Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Unnamed Item ⋮ Gate elimination: circuit size lower bounds and \#SAT upper bounds ⋮ Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ Increasing the Output Length of Zero-Error Dispersers ⋮ Improved Extractors for Recognizable and Algebraic Sources ⋮ An Introduction to Randomness Extractors ⋮ Algebraic Independence and Blackbox Identity Testing ⋮ A group action on multivariate polynomials over finite fields ⋮ Algebraic independence in positive characteristic: A $p$-adic calculus ⋮ Extractors and Lower Bounds for Locally Samplable Sources ⋮ How to extract useful randomness from unreliable sources ⋮ Unnamed Item ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Increasing the output length of zero-error dispersers ⋮ Non-malleability against polynomial tampering
This page was built for publication: Extractors and rank extractors for polynomial sources
