Abstract
We study exponential sums of the form S=2−n∑x 0,1 nem(h(x))eq(p(x)), where m,qZ+ are relatively prime, p is a polynomial with coefficients in Zq, and h(x)=a(x1++xn) for some 1a
Cite
CITATION STYLE
APA
Green, F., Roy, A., & Straubing, H. (2005). Bounds on an exponential sum arising in Boolean circuit complexity. Comptes Rendus. Mathématique, 341(5), 279–282. https://doi.org/10.1016/j.crma.2005.07.011
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free