Monotone Boolean functions
From MaRDI portal
Recommendations
Cited in
(40)- On orders of two transformation semigroups of the Boolean.
- scientific article; zbMATH DE number 1936762 (Why is no real title available?)
- The criterion of \(\tilde \alpha\)-monotonicity of Boolean functions
- Functions computed by monotone Boolean formulas with no repeated variables
- Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity
- Maximal independent sets in bipartite graphs obtained from Boolean lattices
- The number of monotone and self-dual Boolean functions.
- On the polytope of non-additive measures
- Linear transformations of monotone functions on the discrete cube
- scientific article; zbMATH DE number 7447732 (Why is no real title available?)
- A recursion-theoretic characterisation of the positive polynomial-time functions
- Counting inequivalent monotone Boolean functions.
- Hyperidentities and related concepts. II
- scientific article; zbMATH DE number 6351494 (Why is no real title available?)
- De Morgan functions and free De Morgan algebras.
- On Dedekind's problem for complete simple games
- On derandomization and average-case complexity of monotone functions
- On the complexity of realizations of Boolean functions in some classes of hypercontact circuits
- Lower bound on the correlation between monotone families in the average case
- Distributive and completely distributive lattice extensions of ordered sets
- scientific article; zbMATH DE number 4134114 (Why is no real title available?)
- Generation of Boolean functions under the assumption of monotonicity
- About complexity of implementing threshold functions
- On the structure of the \(k\)-additive fuzzy measures
- Joint realizability of monotone Boolean functions
- scientific article; zbMATH DE number 3867232 (Why is no real title available?)
- A functional completeness theorem for De Morgan functions.
- On the enumeration of some inequivalent monotone Boolean functions
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
- Locally monotone Boolean and pseudo-Boolean functions
- The splitting technique in monotone recognition
- Secret sharing schemes for ports of matroids of rank 3.
- Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
- Enumerating matroids of fixed rank
- A note on the growth of the dimension in complete simple games
- Boole-De Morgan bilattices
- On hierarchical loglinear models in capture-recapture studies
- The linear chromatic number of a Sperner family
- The minimal hitting set generation problem: algorithms and computation
- Hyperidentities and related concepts. I
This page was built for publication: Monotone Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4829648)
