Results 271 to 280 of about 5,251,527 (295)
Some of the next articles are maybe not open access.

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   +3 more sources

On Derandomized Composition of Boolean Functions

computational complexity, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Simplified Decomposition of Boolean Functions

IEEE Transactions on Computers, 1976
The object of this paper is the presentation of a theory of decomposition of Boolean functions having the following properties: 1) ease of understanding and application without previous decomposition theory background; 2) flexibility of application to meet varying logic design criteria; 3) suitability of both numerical calculation and chart techniques;
openaire   +2 more sources

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

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

Function perturbations on singular Boolean networks

Automatica, 2017
Hongwei Chen, Jinde Cao
exaly  

Curvature of the Boolean majority function

Discrete Mathematics and Applications, 2022
exaly  

Detection of Group Invariance or Total Symmetry of a Boolean Function*

Bell System Technical Journal, 1956
E J McCluskey
exaly  

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

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

On a Theory of Boolean Functions

Journal of the Society for Industrial and Applied Mathematics, 1959
openaire   +2 more sources

Home - About - Disclaimer - Privacy