scientific article; zbMATH DE number 3825713
From MaRDI portal
Publication:3671891
Cited in
(47)- Maximal independent sets in bipartite graphs obtained from Boolean lattices
- Supersaturation, counting, and randomness in forbidden subposet problems
- Counting combinatorial choice rules
- Complexity of single dynamic tests for monotone Boolean functions
- Numerical characterization of \(n\)-cube subset partitioning
- Almost all monotone Boolean functions are polynomially learnable using membership queries
- The number of monotone and self-dual Boolean functions.
- The linear chromatic number of a Sperner family
- On the number of databases and closure operations
- On the structure of the \(k\)-additive fuzzy measures
- Many triangulated spheres
- A simple upper bound on the number of antichains in \([t]^n\)
- On algorithm complexity
- Short complete diagnostic tests for circuits with one additional input in the standard basis
- Quadratic secret sharing and conditional disclosure of secrets
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7
- Boolean layer cakes
- Properties of complexity measures for PRAMs and WRAMs
- Injective envelopes of transition systems and Ferrers languages
- On algorithms for construction of all irreducible partial covers
- The growth constant of odd cutsets in high dimensions
- Ordered dynamics in biased and cooperative Boolean networks
- The communication requirements of efficient allocations and supporting prices
- Entropy, independent sets and antichains: A new approach to Dedekind's problem
- The number of maximal independent sets in the Hamming cube
- Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- Supersaturation in posets and applications involving the container method
- Estimating the efficiency of threshold representations of Boolean functions
- Supersaturation, counting, and randomness in forbidden subposet problems
- There are more strategy-proof procedures than you think
- On the number of simplicial complexes in \(\mathbb{R}^ d\)
- On the number of antichains and antichain covers of labeled sets
- Guided inference of nested monotone Boolean functions
- Relations between powers of Dedekind numbers and exponential sums related to them
- Rigidity of proper colorings of \(\mathbb{Z}^d \)
- About some properties of Horn and anti-Horn functions
- Efficient minimization of higher order submodular functions using monotonic Boolean functions
- Enumerating matroids of fixed rank
- A computation of the ninth Dedekind number
- A survey of some combinatorial results concerning functional dependencies in database relations.
- On some extremal and probabilistic questions for tree posets
- Finite algebras with large free spectra
- Free monoids and generalized metric spaces
- The splitting technique in monotone recognition
- Maximal independent sets in the covering graph of the cube
- On a Partial Order Related to Divisibility
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671891)
