Can low degree . . .  modulo functions over finite fields?

Can low degree . . . modulo functions over finite fields? (2009)

Cached

Download Links

[www.is.titech.ac.jp]

by Akinori Kawachi , Hidetoki Tanaka , Osamu Watanbe

BibTeX

@MISC{Kawachi09canlow,
    author = {Akinori Kawachi and Hidetoki Tanaka and Osamu Watanbe},
    title = {Can low degree . . . modulo functions over finite fields?},
    year = {2009}
}

Bookmark

OpenURL

Abstract

Citations

408	Concrete Mathematics: A Foundation for Computer Science, 2nd edition - Graham, Knuth, et al. - 1994
262	Algebraic methods in the theory of lower bounds for Boolean circuit complexity - Smolensky - 1987
85	A new proof of Szemerédi’s theorem for arithmetic progressions of length four - Gowers - 1998
40	Gowers Uniformity, Influence of Variables, and PCPs - Samorodnitsky, Trevisan - 2006
27	Pseudorandom bits for polynomials - Bogdanov, Viola
27	Low degree tests at large distances - Samorodnitsky
25	Beigel Lower Bounds for Approximations by Low Degree Polynomials over Zm - Alon, R - 2001
15	A new proof of Szemerédi’s theorem, Geometric and Functional Analysis - Gowers - 2001
14	The sum of d small-bias generators fools polynomials of degree d - Viola - 2008
9	Pseudorandom generators for low degree polynomials - Bogdanov - 2005
7	bounds on the size of bounded depth circuits over a complete basis with logical addition - Lower - 1987
3	An improved bound on correlation between polynomials over Zm and MODq - Chattopadhyay - 2006
1	Threshold circuits of bounded depth - Lovett - 1993