Search
Now showing items 1-1 of 1
A Class of Boolean Functions with Linear Combinatorial Complexity
(1974-10)
In this paper we investigate the combinatorial complexity of Boolean functions satisfying a certain property, P^nk,m. A function of n variable has the P^nk,m property if there are at least m functions obtainable from each ...