Pages that link to "Item:Q3638034"
From MaRDI portal
The following pages link to A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (Q3638034):
Displaying 10 items.
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← 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 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)
- 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)