An entropy measure for the complexity of multi-output Boolean functions

The complexity of a Boolean function can be expressed in terms of computational work. We present experimental data in support of the entropy definition of computational work based upon the input-output description of a Boolean function. Our data show a linear relationship between the computational w...

Celý popis