Pages that link to "Item:Q1089348"
From MaRDI portal
The following pages link to Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348):
Displaying 32 items.
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum (Q490225) (← links)
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
- Monotone clutters (Q688257) (← links)
- The threshold order of a Boolean function (Q805595) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Counting and enumerating aggregate classifiers (Q955312) (← links)
- Dualization of regular Boolean functions (Q1084376) (← links)
- An O(m n) algorithm for regular set-covering problems (Q1095668) (← links)
- Sets uniquely determined by projections on axes. II: Discrete case (Q1182577) (← links)
- An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (Q1327236) (← links)
- On the characterization of weighted simple games (Q1698978) (← links)
- On minimum sum representations for weighted voting games (Q1761826) (← links)
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Decompositions of positive self-dual Boolean functions (Q1893164) (← links)
- Boolean minors (Q1894774) (← links)
- A special case of set covering problems (Q1908929) (← links)
- On the geometric separability of Boolean functions (Q1917289) (← links)
- Minimum self-dual decompositions of positive dual-minor Boolean functions (Q1961458) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- A note on the growth of the dimension in complete simple games (Q2019365) (← links)
- Trading transforms of non-weighted simple games and integer weights of weighted simple games (Q2157830) (← links)
- Decomposing 1-Sperner hypergraphs (Q2315439) (← links)
- Joint realizability of monotone Boolean functions (Q2672606) (← links)
- On the complexity of the decisive problem in simple and weighted games (Q2840677) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- On the complexity of problems on simple games (Q5388151) (← links)
- Tree-shellability of Boolean functions (Q5958139) (← links)
