Uniqueness of optimal mod 3 polynomials for parity

DOI10.1016/j.jnt.2009.08.016zbMath1200.11059OpenAlexW2077826223MaRDI QIDQ962998

Frederic Green, Amitabha Roy

Publication date: 8 April 2010

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2009.08.016

zbMATH Keywords

quadratic formsExponential sumsBoolean circuit complexitytight bounds

Mathematics Subject Classification ID

Estimates on exponential sums (11L07)

Related Items (1)

Block-symmetric polynomials correlate with parity better than symmetric

Cites Work

• Unnamed Item
• Unnamed Item
• Estimation of certain exponential sums arising in complexity theory
• Incomplete quadratic exponential sums in several variables
• The correlation between parity and quadratic polynomials mod \(3\)
• Threshold circuits of bounded depth
• Bounds on an exponential sum arising in Boolean circuit complexity
• On the correlation of symmetric functions
• On the Correlation Between Parity and Modular Polynomials

This page was built for publication: Uniqueness of optimal mod 3 polynomials for parity