Fetching the paper…
Reading the bibliography…
Let $f$ be a polynomial of degree $d$ in $n$ variables over a finite field $\mathbb{F}$.
Die frage der endlich vielen schritte in der theorie der polynomideale
Grete Hermann · 1926
Earlier work this paper cites.
List decoding for noisy channels
P. Elias · 1957
Earlier work this paper cites.
J. Wozencraft · 1958
Earlier work this paper cites.
A new upper bound for error-correcting codes
S. Johnson · 1962
Earlier work this paper cites.
Zeros of polynomials over finite fields
James Ax · 1964
Earlier work this paper cites.
On a theorem of ax
Nicholas Katz · 1971
Earlier work this paper cites.
The theory of error correcting codes
MacWilliams, Florence Jessie and Sloane, Neil James Alexander · 1977
Earlier work this paper cites.
Regular partitions of graphs
Endre Szemerédi · 1978
Earlier work this paper cites.
Bounds for the degrees in the nullstellensatz
W. Dale Brownawell · 1987
Earlier work this paper cites.
Sharp effective nullstellensatz
Janos Kollar · 1988
Earlier work this paper cites.
A hard-core predicate for all one-way functions
O. Goldreich and L. Levin · 1989
Earlier work this paper cites.
Counting rational points on curves over finite fields (extended abstract)
Ming-Deh A. Huang and Doug Ierardi · 1993
Earlier work this paper cites.
Learning decision trees using the Fourier spectrum
E. Kushilevitz and Y. Mansour · 1993
Earlier work this paper cites.
Counting rational points on curves and abelian varieties over finite fields
Leonard M. Adleman and Ming-Deh A. Huang · 1996
Earlier work this paper cites.
Counting curves and their projections
Joachim Von Zur Gathen, Marek Karpinski, and Igor Shparlinski · 1996
Earlier work this paper cites.
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
J. Jackson · 1997
Cited alongside, same era.
An algorithm for approximate counting of points on algebraic sets over finite fields
Ming-Deh Huang and Yiu-Chung Wong · 1998
Cited alongside, same era.
Quick approximation to matrices and applications
Alan M. Frieze and Ravi Kannan · 1999
Cited alongside, same era.
Learning polynomials with queries: The highly noisy case
O. Goldreich, R. Rubinfeld, and M. Sudan · 2000
Cited alongside, same era.
Pseudorandom generators without the XOR lemma
M. Sudan, L. Trevisan, and S. P. Vadhan · 2001
Cited alongside, same era.
Extractors from Reed-Muller codes
A. Ta-Shma, D. Zuckerman, and S. Safra · 2001
Cited alongside, same era.
Worst case to average case reductions for polynomials
Tali Kaufman and Shachar Lovett · 2008
Later among the works it cites.
Detecting rational points on hypersurfaces over finite fields
Swastik Kopparty and Sergey Yekhanin · 2008
Later among the works it cites.
The distribution of polynomials over finite fields, with applications to the gowers norms
B. Green and T. Tao · 2009
Later among the works it cites.
Unbalanced expanders and randomness extractors from parvaresh–vardy codes
Venkatesan Guruswami, Christopher Umans, and Salil Vadhan · 2009
Later among the works it cites.
The sum of d small-bias generators fools polynomials of degree d
Emanuele Viola · 2009
Later among the works it cites.
A Fourier-analytic approach to Reed-Muller decoding
P. Gopalan · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Proving hard-core predicates using list decoding
A. Akavia, S. Goldwasser, and S. Safra · 2003
Cited alongside, same era.
List-decoding using the XOR lemma
L. Trevisan · 2003
Cited alongside, same era.
Pseudorandom generators for low degree polynomials
Andrej Bogdanov · 2005
Cited alongside, same era.
Simple extractors for all min-entropies and a new pseudorandom generator
Ronen Shaltiel and Christopher Umans · 2005
Cited alongside, same era.
Pseudorandom bits for polynomials
A. Bogdanov and E. Viola · 2007
Cited alongside, same era.
Decodability of group homomorphisms beyond the johnson bound
Irit Dinur, Elena Grigorescu, Swastik Kopparty, and Madhu Sudan · 2008
Cited alongside, same era.
Holes in generalized reed-muller codes
Shachar Lovett · 2010
Later among the works it cites.
Pseudorandomness
Salil P. Vadhan · 2012
Later among the works it cites.
Every locally characterized affine-invariant property is testable
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, and Shachar Lovett · 2013
Later among the works it cites.
Terence Tao · 2013
Later among the works it cites.
Polynomial decompositions in polynomial time
Arnab Bhattacharyya · 2014
Later among the works it cites.
Using higher-order fourier analysis over general fields
Arnab Bhattacharyya and Abhishek Bhowmick · 2015
Closest in time.
Algorithmic regularity for polynomials and applications
Arnab Bhattacharyya, Pooya Hatami, and Madhur Tulsiani · 2015
Closest in time.
List decoding reed-muller codes over small fields
Abhishek Bhowmick and Shachar Lovett · 2015
Closest in time.