Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Babai et al. (1992) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: