Results 281 to 290 of about 51,980 (308)

On the classification of Boolean functions

IRE Transactions on Information Theory, 1959
Two Boolean functions which differ only by permutation and complementation of their n input variables belong to the same symmetry class. Methods are described for determining the number of symmetry classes for functions of n variables, and for ascertaining whether or not two functions belong to the same class.
openaire   +1 more source

Learning boolean functions

Systems and Computers in Japan, 1991
AbstractAlthough various formal models of learning have been studied in the past, a realistic model taking into consideration the time required for learning has not been proposed. Recently, Valiant [8] proposed a general learning model based on the theory of computational complexity, gave a definition of learnability, and obtained various classes of ...
Qian-Ping Gu, Akira Maruoka
openaire   +1 more source

Monotone Boolean functions

Russian Mathematical Surveys, 2003
Summary: Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published.
openaire   +2 more sources

On the independence of Boolean functions

International Journal of Computer Mathematics, 2005
Boolean functions are widely used because they can be used to precisely describe logical circuits. Properties of Boolean functions with respect to their applications to cryptography have been studied, but relationship between Boolean functions are rarely studied.
openaire   +1 more source

The complexity of monotone boolean functions

Mathematical Systems Theory, 1977
We study the realization of monotone Boolean functions by networks. Our main result is a precise version of the following statement: the complexity of realizing a monotone Boolean function ofn arguments is less by the factor (2/πn)1/2, whereπ is the circular ratio, than the complexity of realizing an arbitrary Boolean function ofn arguments.
openaire   +1 more source

On the Design of Universal Boolean Functions

IEEE Transactions on Computers, 1971
A Boolean function U( z 1 ,...,z m ) is universal for given n≥1 and a set I of variables if it realizes all Boolean functions f(x 1 ,..., x n ) by substituting for each zj a variable of I. Designs of universal Boolean functions for various specifications of I are considered for the practical cases of ...
openaire   +2 more sources

Robustness for Stability and Stabilization of Boolean Networks With Stochastic Function Perturbations

IEEE Transactions on Automatic Control, 2021
Haitao Li, Xinrong Yang, Shuling Wang
exaly  

Stability analysis of activation‐inhibition Boolean networks with stochastic function structures

Mathematical Methods in the Applied Sciences, 2020
Guodong Zhao, Haitao Li
exaly  

Function perturbations on singular Boolean networks

Automatica, 2017
Bowen Li, Hongwei Chen, Jinde Cao
exaly  

Sampled-Data State-Feedback Stabilization of Probabilistic Boolean Control Networks: A Control Lyapunov Function Approach

IEEE Transactions on Cybernetics, 2020
Jiayang Liu, Yuqian Guo, Weihua Gui
exaly