Pages that link to "Item:Q3579198"
From MaRDI portal
The following pages link to New results on monotone dualization and generating hypergraph transversals (Q3579198):
Displaying 12 items.
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Pareto-optimal patterns in logical analysis of data (Q1885813) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
