Exponential sums and circuits with a single threshold gate and mod-gates

DOI10.1007/s002240000126zbMath0937.68051OpenAlexW1969981165MaRDI QIDQ1293551

K. Appert

Publication date: 13 June 2000

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000126

zbMATH Keywords

complexity theorybounded-depth circuits

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Correlation lower bounds from correlation upper bounds ⋮ The correlation between parity and quadratic polynomials mod \(3\) ⋮ Block-symmetric polynomials correlate with parity better than symmetric ⋮ On the correlation between parity and modular polynomials ⋮ Incomplete quadratic exponential sums in several variables

This page was built for publication: Exponential sums and circuits with a single threshold gate and mod-gates