On Dedekind's Problem: The Number of Monotone Boolean Functions
From MaRDI portal
Publication:5580268
DOI10.2307/2036446zbMath0186.30702OpenAlexW4247649254MaRDI QIDQ5580268
Publication date: 1969
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2036446
Related Items
The number of monotone and self-dual Boolean functions., Enumeration of extensions of the cycle matroid of a complete graph, Number of functions in classes given by central predicates, Many triangulated spheres, Counting maximal antichains and independent sets, On the number of databases and closure operations, On the number of simplicial complexes in \(\mathbb{R}^ d\), Supersaturation, counting, and randomness in forbidden subposet problems, Counting combinatorial choice rules, Maximal independent sets in bipartite graphs obtained from Boolean lattices, Multicolor chain avoidance in the Boolean lattice, Maximal independent sets in the covering graph of the cube, Unnamed Item, On counting Sperner families, Applications of graph containers in the Boolean lattice, The level polynomials of the free distributive lattices, On the state complexity of closures and interiors of regular languages with subwords and superwords, 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, Counting unique-sink orientations, Antichains and completely separating systems -- a catalogue and applications, Counting families of mutually intersecting sets, Counting inequivalent monotone Boolean functions., Logical analysis of data: classification with justification, Efficient minimization of higher order submodular functions using monotonic Boolean functions, The splitting technique in monotone recognition, Counting and enumerating aggregate classifiers, Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem, Entropy, independent sets and antichains: A new approach to Dedekind’s problem, Unnamed Item, Intersecting families of discrete structures are typically trivial, The complexity of monotone boolean functions, Relations between gene regulatory networks and cell dynamics in Boolean models, Extremal problems among subsets of a set. (Reprint), Recursive matching algorithms and linear orders on the subset lattice, Maximal k-Intersecting Families of Subsets and Boolean Functions, Graphs for Margins of Bayesian Networks, Isotone lattice-valued Boolean functions and cuts, Enumeration of intersecting families, Extremal problems among subsets of a set, Establishment of Ad-Hoc Communities through Policy-Based Cryptography, Unnamed Item, Algorithms counting monotone Boolean functions
