On the argument complexity of multiply transitive Boolean functions
What we have done is just excluding some kinds of groups for being the stabilizer of a nonexhaustive Boolean function. The next step would be to investigate, if in the remaining set of groups there exists a group, which yields a counterexample. If there is no such group, then 2-transitivity of a Boolean function P with P(0) ≠ P (1) would imply the exhaustiveness of P.
Unable to display preview. Download preview PDF.
- R. D. Carmichael, Groups of finite order, Boston, Ginn&Co, 1937.Google Scholar
- N. Illies, A counterexample to the generalized Aanderaa-Rosenberg conjecture, Inform. Proc. Lett. 7(1978), no. 3, 154–155.Google Scholar
- C. Jordan, Sur la limite de transitivite des groupes non alternes, Bull. Soc. Math. France 1 (1873), 40–71.Google Scholar
- A. L. Rosenberg, On the time required to recognize properties of graphs: A problem, SIGACT News 5(1973), 15–16.Google Scholar
- R. L. Rivest, J. Vuillemin, On recognizing graph properties from adjacency matrices, Theor. Comp. Sci. 3(1976), 371–384.Google Scholar
- H. Wielandt, Finite permutation groups, New York — London, Academic Press, 1964.Google Scholar