boolean 
They have proved that if the set of keys is a Boolean algebra or a finite field, then there does not exist a twooperation homomorphic sharing scheme.


In this paper the decomposition formula of Walsh spectrum of boolean functions is used to construct a class of nonlinear resilient functions.


Boolean parallel algorithm is improved to discover frequent fuzzy attribute set, and the fuzzy association rules with at least a minimum confidence are generated on all processors.


Considering connections of characteristics, this paper is aimed at the construction of optimized Boolean functions.


The design of reflexive behavior models for situation specific choice is investigated under the assumption that the model is based on multivalued Boolean scales.


To construct the EXORTDD for a given function f, the Boolean derivatives of all possible orders were determined with respect to all variables of f.


Multiplicative Properties of Spectral Walsh Coefficients of the Boolean Function


It is shown for the first time that spectral Walsh coefficients of the Boolean function have the structure in the form of the product of Walsh derivatives of this function.


A method and an algorithm are suggested for the analysis of multiplicative properties of Walsh coefficients in terms of the behavior of the Boolean function and results of the experiments on test logic circuits are given.


For systems of multistate elements, the problem of developing Boolean reliability models was considered on the basis of multivalued logic, cortege algebra, algebra of groups of incompatible events, and classical logicandprobabilistic method.


Development of Boolean reliability models based on the multivalued logic was shown to be unadvisable.


Boolean Reflexive Control Models and Their Application to Describe the Information Struggle in SocioEconomic Systems


Boolean reflexive behavior models that take account of conflicts between two agents are described.


Large Systems of Boolean Functions: Realization by Modular Arithmetic Methods


Algorithms for Synthesis of Polynomials Implementing Weakly Specified Boolean Functions and Systems


Weakly specified Boolean functions and systems are considered.


A Mechanism of Uncovering of Quantifiers in Boolean Variables


Classification of Boolean functions by the invariants of their matrix representation


A variant of matrix representation for Boolean functions is designed such that these functions can be classified by matrix invariants.


One criterion for comparability of bases for the realization of Boolean functions by formulas

