Most Complex Boolean Functions
نویسنده
چکیده
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 the Specialized Normal Form (SNF). The SNF is a unique (canonical) ESOP representation of a Boolean function. In this paper properties of the most complex Boolean functions are studied. Adjacency graphs of the SNF will be used to calculate minimal ESOPs as well as to detect special properties of most complex Boolean functions. These properties affect the procedure of finding exact minimal ESOPs. A solution is given that overcomes these observed problems. Using the SNF, the number of most complex Boolean functions was found. A recursive algorithm will be given that calculates each most complex Boolean function for a given number of variables.
منابع مشابه
Most Complex Boolean Functions Detected by the Specialized Normal Form
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, ...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملCriterion for Stability in Random Boolean Cellular
Random boolean cellular automata are investigated, where each gate has two randomly chosen inputs and is randomly assigned a boolean function of its inputs. The e ect of non-uniform distributions on the choice of the boolean functions is considered. The main results are that if the gates are more likely to be assigned constant functions than non-canalyzing functions, then with very high probabi...
متن کاملRecent Results on Ordering Parameters in Boolean Networks
The dynamics of discrete mathematical systems can be related to the values of certain ordering parameters. Experiments with the total set of possible structures of a boolean network with six elements and extended sets of two-valued boolean functions show that three simple parameters describing the topology, the bias of boolean functions, and their canalyzing potential yield necessary conditions...
متن کاملBoolean functions and discrete dynamics: analytic and biological application
Modeling complex gene interacting systems as Boolean networks lead to a significant simplification of computational investigation. This can be achieved by discretization of the expression level to ON or OFF states and classifying the interactions to inhibitory and activating. In this respect, Boolean functions are responsible for the evolution of the binary elements of the Boolean networks. In ...
متن کامل