Pages that link to "Item:Q4386450"
From MaRDI portal
The following pages link to A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions (Q4386450):
Displaying 11 items.
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Guided inference of nested monotone Boolean functions (Q1810471) (← 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)
- Complexity of identification and dualization of positive Boolean functions (Q2508337) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- A fast and simple algorithm for identifying 2-monotonic positive Boolean functions (Q6487975) (← links)
