Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
The Number of Monotone and Self-Dual Boolean Functions
View through CrossRef
Abstract
In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbreviated d.n.f., a minimal d.n.f. and a shortest d.n.f. of this function. Then we present a d.n.f. with the highest number of conjunctionsand we determinate the exact number of them. We count the number of monotone Boolean functions with some special properties. In the end we estimate the number of Boolean functionthat are monotone and self-dual at the same time.
Walter de Gruyter GmbH
Title: The Number of Monotone and Self-Dual Boolean Functions
Description:
Abstract
In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions.
We discuss interval graph, the abbreviated d.
n.
f.
, a minimal d.
n.
f.
and a shortest d.
n.
f.
of this function.
Then we present a d.
n.
f.
with the highest number of conjunctionsand we determinate the exact number of them.
We count the number of monotone Boolean functions with some special properties.
In the end we estimate the number of Boolean functionthat are monotone and self-dual at the same time.
Related Results
Some Contributions to Boolean like near Rings
Some Contributions to Boolean like near Rings
In this paper we extend Foster’s Boolean-like ring to Near-rings. We introduce the concept of a Boolean like near-ring. A near-ring N is said to be a Boolean-like near-ring if the...
Associated Statistical Parameters’ Aggregations in Interactive MADM
Associated Statistical Parameters’ Aggregations in Interactive MADM
From recent studies, the concept of “monotone expectation” (ME) of Interactive Multi-Attribute Decision Making (MADM) is well known, which was developed for the case of different f...
Boolean Functions with Affine Annihilators
Boolean Functions with Affine Annihilators
In the article we study boolean functions with affine annihilators. We have obtained results in both, estimating the number of functions under study and defining the relationship b...
Fixed points and multistability in monotone Boolean network models
Fixed points and multistability in monotone Boolean network models
Abstract
Gene regulatory networks (GRN) control the expression levels of proteins in cells, and understanding their dynamics is key to potentially controlling disea...
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudo-Boolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Is a Fitbit a Diary? Self-Tracking and Autobiography
Is a Fitbit a Diary? Self-Tracking and Autobiography
Data becomes something of a mirror in which people see themselves reflected. (Sorapure 270)In a 2014 essay for The New Yorker, the humourist David Sedaris recounts an obsession spu...
Indeterminacy of Boolean Ring
Indeterminacy of Boolean Ring
Background A neutrosophic ring represents an algebraic generalization of the classical ring structure by introducing an indeterminacy element I , enabling the modeling of truth, fa...
The improved Levin’s algorithm for constrained probabilistic pseudo-Boolean functions
The improved Levin’s algorithm for constrained probabilistic pseudo-Boolean functions
The problem of finding “highly probable” approximations of Boolean functions consists in generating a list of all linear Boolean functions that agree with a given Boolean function ...