Complexity bounds on program realizations of Boolean functions specified in various forms
We examine the complexity bounds on binary, k-ary, and matrix programs which represent Boolean functions specified in various forms.
scientific article; zbMATH DE number 4045653