Algorithms counting monotone Boolean functions

DOI10.1016/S0020-0190(00)00230-1zbMath1032.68113WikidataQ127570411 ScholiaQ127570411MaRDI QIDQ1603481

A. Włodzimierz Mostowski, Andrzej Szepietowski, Robert Fidytek, Rafał Somla

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsCombinatorial problemsDedekind problemFree distributive latticeMonotone Boolean function

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items

On the polytope of non-additive measures ⋮ Enumerating orientations of the free spikes ⋮ Unnamed Item ⋮ On the enumeration of some inequivalent monotone Boolean functions ⋮ Generalized spectra and applications to finite distributive lattices ⋮ Counting inequivalent monotone Boolean functions. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On hierarchical loglinear models in capture-recapture studies ⋮ Representable orientations of the free spikes ⋮ Unnamed Item

Cites Work

• On Dedekind's Problem: The Number of Monotone Boolean Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item