Boolean functions, invariance groups and parallel complexity

The authors study the invariance groups S(f) of Boolean functions f in B/sub n/ on n variables. They give necessary and sufficient conditions for a general permutation group to be of the form S(f), for some f in B/sub n/. This leads to an almost optimal algorithm for deciding the representability of an arbitrary permutation group. For cyclic groups G>