Counting inequivalent monotone Boolean functions.

DOI10.1016/j.dam.2013.11.015zbMath1311.06011arXiv1209.4623OpenAlexW2015132157MaRDI QIDQ2440095

Timothy Yusun, Tamon Stephen

Publication date: 27 March 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.4623

zbMATH Keywords

monotone Boolean functionsDedekind numbersisotone Boolean functionsnumbers of Boolean functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Boolean functions (06E30)

Related Items

On the enumeration of some inequivalent monotone Boolean functions ⋮ Counting inequivalent monotone Boolean functions. ⋮ The monoid of monotone functions on a poset and quasi-arithmetic multiplicities for uniform matroids ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity ⋮ Maximal sensitivity of Boolean nested canalizing functions ⋮ Unnamed Item ⋮ On the expressivity of inconsistency measures

Uses Software

• Matlab
• JBool
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A computation of the eighth Dedekind number
• Algorithms counting monotone Boolean functions
• Semi-distance codes and Steiner systems
• Counting inequivalent monotone Boolean functions.
• On the Complexity of the Decisive Problem in Simple and Weighted Games
• A solution of Dedekind's problem on the number of isotone Boolean functions.
• Monotone Boolean functions
• On Dedekind's Problem: The Number of Monotone Boolean Functions