A Boolean function requiring 3n network size
نویسندگان
چکیده
منابع مشابه
A Boolean Function Requiring 3n Network Size
Paul [ PJ first proved a 2.Sn-Iower bound for the network complex ity of an explicit boole an function. We mo dify the defi n ition of Pa ul's func tion a little a nd prove a 3n-I ower bound for th e network complexity of that function.-1
متن کاملA Dynamical Boolean Network
We propose a Dynamical Boolean Network (DBN), which is a Boolean network whose set of states is fixed but whose transition matrix can change from one discrete time step to another. At any time step, the transition matrix of our DBN is of the formQ−1TQ, where T is a transition matrix defined in the course of the construction of our DBN and Q is the matrix representation of some permutation P of ...
متن کاملA Dynamic Boolean Network
We propose a Dynamic Boolean Network in which a state of a Boolean network and an output label associated with the state are interacting with each other, and a transition matrix keeps changing perpetually. We extrapolate a mutation of a transition matrix as T → Q−1TQ where T is a transition matrix and Q is a matrix representation of a permutation P (where the objects permuted are states of DBN)...
متن کاملFunction constrains network architecture and dynamics: a case study on the yeast cell cycle Boolean network.
We develop a general method to explore how the function performed by a biological network can constrain both its structural and dynamical network properties. This approach is orthogonal to prior studies which examine the functional consequences of a given structural feature, for example a scale free architecture. A key step is to construct an algorithm that allows us to efficiently sample from ...
متن کاملLinearly Separable Boolean Function
The maximum absolute value of integral weights sufficient to represent any linearly separable Boolean function is investigated. It is shown that upper bounds exhibited by Muroga (1971) for rational weights satisfying the normalized System of inequalities also hold for integral weights. Therewith, the previous best known upper bound for integers is improved by approximately a factor of 1/2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90029-4