Results 271 to 280 of about 2,786,322 (296)

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

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

On the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing

ACM Transactions on Quantum Computing, 2021
Stuart Hadfield
exaly  

Revealing the canalizing structure of Boolean functions: Algorithms and applications

Automatica, 2022
Brandilyn Stigler, David Murrugarra, Claus Kadelka   +2 more
exaly  

Two memristors suffice to compute all Boolean functions

Electronics Letters, 2010
Mika Laiho
exaly  

Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity

IEEE Transactions on Information Theory, 2009
Longjiang Qu, Keqin Feng
exaly  

On a Theory of Boolean Functions

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