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

Cited in

(53)

Number of functions in classes given by central predicates
Many triangulated spheres
On counting Sperner families
The level polynomials of the free distributive lattices
Recursive matching algorithms and linear orders on the subset lattice
On the number of simplicial complexes in \(\mathbb{R}^ d\)
Algorithms counting monotone Boolean functions
Extremal problems among subsets of a set
Counting families of mutually intersecting sets
Enumeration of extensions of the cycle matroid of a complete graph
Multicolor chain avoidance in the Boolean lattice
Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
Intersecting families of discrete structures are typically trivial
Counting maximal antichains and independent sets
Counting unique-sink orientations
Antichains and completely separating systems -- a catalogue and applications
Counting inequivalent monotone Boolean functions.
Extremal problems among subsets of a set. (Reprint)
On the number of databases and closure operations
Supersaturation, counting, and randomness in forbidden subposet problems
The number of monotone and self-dual Boolean functions.
Entropy, independent sets and antichains: A new approach to Dedekind's problem
Graphs for margins of Bayesian networks
Isotone lattice-valued Boolean functions and cuts
Establishment of ad-hoc communities through policy-based cryptography
Applications of graph containers in the Boolean lattice
scientific article; zbMATH DE number 3918272 (Why is no real title available?)
Maximal independent sets in the covering graph of the cube
The complexity of monotone boolean functions
Relations between powers of Dedekind numbers and exponential sums related to them
Maximal \(k\)-intersecting families of subsets and Boolean functions
On the number of antichains and antichain covers of labeled sets
Efficient minimization of higher order submodular functions using monotonic Boolean functions
The splitting technique in monotone recognition
Maximal independent sets in bipartite graphs obtained from Boolean lattices
Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
On some extremal and probabilistic questions for tree posets
Intersecting families of sets are typically trivial
On the number of high‐dimensional partitions
Generalized spectra and applications to finite distributive lattices
The strongest model of computation obeying 0-1 Principles
Logical analysis of data: classification with justification
Supersaturation, counting, and randomness in forbidden subposet problems
Generalized rank functions and quilts of alternating sign matrices
Dedekind's problem in the hypergrid
Diagrams of quantales and Lipschitz norms
Note on the number of antichains in generalizations of the Boolean lattice
Relations between gene regulatory networks and cell dynamics in Boolean models
On Dedekind's problem, a sparse version of Sperner's theorem, and antichains of a given size in the Boolean lattice
Enumeration of intersecting families
Counting combinatorial choice rules
On the state complexity of closures and interiors of regular languages with subwords and superwords
Counting and enumerating aggregate classifiers

This page was built for publication: On Dedekind's Problem: The Number of Monotone Boolean Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5580268)