Bounds on an exponential sum arising in Boolean circuit complexity
From MaRDI portal
Publication:2565522
DOI10.1016/j.crma.2005.07.011zbMath1113.11051MaRDI QIDQ2565522
Amitabha Roy, Howard Straubing, Frederic Green
Publication date: 27 September 2005
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.crma.2005.07.011
11L07: Estimates on exponential sums
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Depth Reduction for Composites, Correlation lower bounds from correlation upper bounds, On the correlation between parity and modular polynomials, Uniqueness of optimal mod 3 polynomials for parity, Block-symmetric polynomials correlate with parity better than symmetric
Cites Work