The expressive power of voting polynomials
On ACC
Computational Complexity
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC ’91
James Aspnes
Jun Tarui
Steven Rudich
Merrick Furst
On the degree of Boolean functions as real polynomials
Degree lower bounds of tower-type for approximating formulas with parity quantifiers