Affine Dispersers from Subspace Polynomials

DOI10.1137/110826254zbMath1253.68253OpenAlexW2051985271MaRDI QIDQ3143296

Swastik Kopparty, Eli Ben-Sasson

Publication date: 29 November 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110826254

zbMATH Keywords

extractorslinearized polynomialsaffine extractorssubspace polynomialsdispersersderandomzation

Mathematics Subject Classification ID

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

Related Items (10)

On the limits of gate elimination ⋮ Analogues of the Balog-Wooley decomposition for subsets of finite fields and character sums with convolutions ⋮ Gate elimination: circuit size lower bounds and \#SAT upper bounds ⋮ Unnamed Item ⋮ Linearized trinomials with maximum kernel ⋮ Constructions of cyclic constant dimension codes ⋮ Roots and coefficients of polynomials over finite fields ⋮ A quadratic lower bound for homogeneous algebraic branching programs ⋮ Polynomial values in affine subspaces of finite fields ⋮ Sums of inverses in thin sets of finite fields

This page was built for publication: Affine Dispersers from Subspace Polynomials