A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
It is well known that Exclusive Sum-Of-Products (ESOP) expressions for Boolean functions require on average the smallest number of cubes. Thus, a simple complexity measure for a Boolean function is the number of cubes in its simplest ESOP. It will be shown that this structure-oriented measure of the complexity can be improved by a unique complexity measure which is based on the function. Thus, it is suggested to detect all most complex Boolean functions more precisely by means of thedoi:10.2298/fuee0703259s fatcat:3tfbmazb4vcmfi7ug2abbvmue4