Key points are not available for this paper at this time.
We examine the effect of symmetry on the complexity of Boolean functions and find a remarkably tight hierarchy. Generalizing the fact that all symmetric Boolean functions belong to (nonuniform) Z'CO, we find that the complexity of the class of Boolean functions admitting a given group of symmetries is essentially determined by a single parameter of that group.
Babai et al. (Wed,) studied this question.