scientific article
From MaRDI portal
Publication:3671891
zbMath0521.94018MaRDI QIDQ3671891
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
asymptotic expressionscomplexity of the minimal disjunctive normal formsnumber of elements of the free distributive lattice with n generatorsnumber of monotone Boolean functions of n variables
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (45)
The number of monotone and self-dual Boolean functions. ⋮ Quadratic secret sharing and conditional disclosure of secrets ⋮ Many triangulated spheres ⋮ On algorithms for construction of all irreducible partial covers ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ On the number of databases and closure operations ⋮ Ordered dynamics in biased and cooperative Boolean networks ⋮ On a Partial Order Related to Divisibility ⋮ On the number of simplicial complexes in \(\mathbb{R}^ d\) ⋮ Estimating the efficiency of threshold representations of Boolean functions ⋮ Supersaturation, counting, and randomness in forbidden subposet problems ⋮ Finite algebras with large free spectra ⋮ Counting combinatorial choice rules ⋮ Short complete diagnostic tests for circuits with one additional input in the standard basis ⋮ Maximal independent sets in bipartite graphs obtained from Boolean lattices ⋮ Maximal independent sets in the covering graph of the cube ⋮ Supersaturation in posets and applications involving the container method ⋮ Unnamed Item ⋮ On the number of maximal antichains in Boolean lattices for \(n\) up to 7 ⋮ The number of maximal independent sets in the Hamming cube ⋮ On some extremal and probabilistic questions for tree posets ⋮ Rigidity of proper colorings of \(\mathbb{Z}^d \) ⋮ Complexity of single dynamic tests for monotone Boolean functions ⋮ The linear chromatic number of a Sperner family ⋮ On algorithm complexity ⋮ Injective envelopes of transition systems and Ferrers languages ⋮ The Growth Constant of Odd Cutsets in High Dimensions ⋮ Efficient minimization of higher order submodular functions using monotonic Boolean functions ⋮ Enumerating matroids of fixed rank ⋮ The splitting technique in monotone recognition ⋮ Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem ⋮ There are more strategy-proof procedures than you think ⋮ Entropy, independent sets and antichains: A new approach to Dedekind’s problem ⋮ Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity ⋮ The communication requirements of efficient allocations and supporting prices ⋮ Properties of complexity measures for PRAMs and WRAMs ⋮ On the structure of the \(k\)-additive fuzzy measures ⋮ A simple upper bound on the number of antichains in \([t^n\)] ⋮ Guided inference of nested monotone Boolean functions ⋮ Free monoids and generalized metric spaces ⋮ Numerical characterization of \(n\)-cube subset partitioning ⋮ Boolean layer cakes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Almost all monotone Boolean functions are polynomially learnable using membership queries
This page was built for publication:
