Hilbert function and complexity lower bounds for symmetric Boolean functions

This paper explores the application of certain algebraic geometry techniques involving Hilbert functions and Gröbner bases to the analysis of properties of Boolean functions. It gives some results and applications for symmetric functions