scientific article; zbMATH DE number 3868606
[For the entire collection see Zbl 0538.00005.] The argument complexity C(P) of a Boolean function \(P:\{0,1\}^ d\to \{0,1\}\) is the number of components of an input vector x which an optimal decision algorithm for P requires in the worst case to decide whether \(P(x)=1\). If \(C(P)=d\), then P is called exhaustive. It is shown that P is exhaustive, if P is nontrivial and invariant under a k- transitive permutation group acting on the arguments, where \(k>(d/3)+1\) (an immediate consequence is that nontrivial symmetric functions are exhaustive). Under the assumption that there is no 6-transitive group except the symmetric and alternating groups, it is shown that there exists a least universal lower bound \(k_ 0\), \(2\leq k_ 0\leq 6\), \(k_ 0\neq 5\), such that \(k_ 0\)-transivity is sufficient for the exhaustiveness of Boolean functions P with \(P(0...0)\neq P(1...1).\) In addition, it is shown that sharply 2-transitivity implies exhaustiveness. Further investigations in the argument complexity of Boolean functions described by group theoretical properties can be found in the author's dissertation which will appear in 1985, where he also shows that \(k_ 0\neq 6\).
- On the multiplicative complexity of Boolean functions
- On the multiplicative complexity of some Boolean functions
- scientific article; zbMATH DE number 4108153
- Multiplicative complexity of some Boolean functions
- The complexity of the representation of multiple-output Boolean functions
- On the complexity of the evaluation of transient extensions of Boolean functions
- On the complexity of the evaluation of transient extensions of Boolean functions
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- On the complexity of restrictions of Boolean functions
- scientific article; zbMATH DE number 1855658
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334980)