Pages that link to "Item:Q943847"

The following pages link to On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847):

Displaying 13 items.

• A study on monotone self-dual Boolean functions (Q523743) (← links)
• Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
• A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
• Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
• Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
• The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
• The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
• Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
• (Q5140714) (← links)
• Decision systems in rough set theory: A set operatorial perspective (Q5376483) (← links)
• On Dualization over Distributive Lattices (Q6045449) (← links)
• Generating minimal redundant and maximal irredundant subhypergraphs (Q6611070) (← links)
• New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems (Q6657241) (← links)