Pages that link to "Item:Q4376178"
From MaRDI portal
The following pages link to The Maximum Latency and Identification of Positive Boolean Functions (Q4376178):
Displaying 19 items.
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← 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)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- Interior and exterior functions of positive Boolean functions. (Q1408452) (← links)
- Almost all monotone Boolean functions are polynomially learnable using membership queries (Q1603482) (← links)
- Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← 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)
- Maximal sensitivity of Boolean nested canalizing functions (Q2272408) (← links)
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724) (← links)
- On algorithms for construction of all irreducible partial covers (Q2379946) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- Unique key Horn functions (Q2672584) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- The Decomposition Tree for analyses of Boolean functions (Q5458074) (← links)
- Tree-shellability of Boolean functions (Q5958139) (← links)
