Results 211 to 220 of about 9,542 (233)

Positively closed classes of partial Boolean functions

Moscow University Computational Mathematics and Cybernetics, 2008
Classes of partial Boolean functions closed with respect to the positive closure operator are considered. All ten classes of this type are determined, of which three classes are positively precomplete. In each of the positively closed classes, a positive basis is established.
S. S. Marchenkov, A. A. Popova
openaire   +1 more source

Partial decoding of monotonic Boolean functions

USSR Computational Mathematics and Mathematical Physics, 1983
A lexicographical ordering of the binary n-cube \(E_ n\) is defined in a natural way. Moreover, the points of \(E_ n\) are partitioned into strata according to their weights. The partial decoding of an n-ary Boolean function f then means the finding of the lexicographically rightmost zeros of f in these strata.
openaire   +2 more sources

Algebraic Properties of Symmetric and Partially Symmetric Boolean Functions

IEEE Transactions on Electronic Computers, 1963
Symmetric and partially symmetric functions are studied from an algebraic point of view. Tests are given for detecting these properties. A more general approach involving the concept of ?-symmetric functions is given. A canonical form is derived for ?-symmetric functions which leads to synthesis procedures that improve results of Shannon.
Arnold, R. F., Harrison, M. A.
openaire   +2 more sources

Generating cryptographically strong Boolean functions using partial information

Periodica Mathematica Hungarica, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Šimovcová, Marta, Stanek, Martin
openaire   +2 more sources

Partial Clones Containing All Selfdual Monotonic Boolean Partial Functions

2009 39th International Symposium on Multiple-Valued Logic, 2009
Let 2 = {0,1}. We show that  the interval of  partial clones containing the set of all selfdual monotonic partial functions  is infinite on 2. We also study some partial clones in that interval.
openaire   +1 more source

Complemented subsets and Boolean-valued, partial functions

Computability
We study the two algebras of complemented subsets that were introduced in the constructive development of the Daniell approach to measure and integration within Bishop-style constructive mathematics. We present their main properties both for the so-called here categorical complemented subsets and for the extensional complemented subsets.
Misselbeck-Wessel, Daniel, Petrakis, Iosif   +1 more
openaire   +1 more source

Symbolic verification of Boolean constraints over partially specified functions

ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196), 2002
Incomplete or partial specifications arise out of mistakes in design or purposefully to avoid loss of generality in application. When designing a system with several partially specified functions, we often impose constraints on the global behavior of the system.
S. Sriram, R. Tandon, P. Dasgupta, P.P. Chakrabarti   +3 more
openaire   +1 more source

Partially unate Boolean functions: Properties of their sum-of-products representations

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions

2006
In this paper the concept of partially perfect nonlinear (PPN) function is introduced as an extension of binary partially Bent function and is used to construct a new class of Boolean functions with good cryptographic properties. The construction is a composition of a PPN function and a Boolean function.
Lei Hu, Xiangyong Zeng
openaire   +1 more source

Decomposition of symmetric and partially symmetric boolean functions in a basis of monotone functions

Cybernetics and Systems Analysis, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Avgul', L. B., Petrochenko, A. S.
openaire   +1 more source