Monotone Boolean functions

From MaRDI portal
Publication:4829648

DOI10.1070/RM2003v058n05ABEH000667zbMath1072.06008OpenAlexW2069683079MaRDI QIDQ4829648

Aleksej Dmitrievich Korshunov

Publication date: 29 November 2004

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/rm2003v058n05abeh000667




Related Items

On the polytope of non-additive measuresOn Dedekind's problem for complete simple gamesDistributive and completely distributive lattice extensions of ordered setsMaximal independent sets in bipartite graphs obtained from Boolean latticesOn orders of two transformation semigroups of the booleanOptimal resource allocation enables mathematical exploration of microbial metabolic configurationsJoint realizability of monotone Boolean functionsUnnamed ItemThe Minimal Hitting Set Generation Problem: Algorithms and ComputationOn derandomization and average-case complexity of monotone functionsCounting inequivalent monotone Boolean functions.Unnamed ItemThe linear chromatic number of a Sperner familyEnumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimumEnumerating matroids of fixed rankAbout complexity of implementing threshold functionsThe splitting technique in monotone recognitionDe Morgan functions and free De Morgan algebras.On hierarchical loglinear models in capture-recapture studiesEnumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacityA note on the growth of the dimension in complete simple gamesOn the structure of the \(k\)-additive fuzzy measuresA functional completeness theorem for De Morgan functions.A recursion-theoretic characterisation of the positive polynomial-time functionsLower bound on the correlation between monotone families in the average caseUnnamed ItemUnnamed ItemLinear transformations of monotone functions on the discrete cubeSecret sharing schemes for ports of matroids of rank 3