Bounds on an exponential sum arising in Boolean circuit complexity;Bornes sur une somme exponentielle liée à la complexité des circuits booléens

Comptes Rendus Mathematique

Volumn 341, Issue 5, 2005, Pages 279-282

  Green, Frederic ^a   Roy, Amitabha ^b   Straubing, Howard ^b  

^a CLARK UNIVERSITY   (United States)

^b BOSTON COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 24344463870     PISSN: 1631073X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.crma.2005.07.011     Document Type: Article

References (4)

1. n, in: Annual IEEE Conference on Computational Complexity, vol. 16, 2001
2. J. Bourgain Estimation of certain exponential sums arising in complexity theory C. R. Acad. Sci. Paris, Ser. I 340 2005 627-631
3. E. Dueñez, S. Miller, A. Roy, H. Straubing, Incomplete quadratic exponential sums in several variables, J. Number Theory, in press
4. F. Green The correlation between parity and quadratic polynomials mod 3 J. Comput. System Sci. 69 1 2004 28-44