A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
From MaRDI portal
Recommendations
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- Computational aspects of monotone dualization: a brief survey
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- On the fixed-parameter tractability of the equivalence test of monotone normal forms
Cited in
(13)- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
- Resolution based algorithms for the transversal hypergraph generation problem
- On the fixed-parameter tractability of the equivalence test of monotone normal forms
- The minimal hitting set generation problem: algorithms and computation
- How to apply SAT-solving for the equivalence test of monotone normal forms
- Achieving new upper bounds for the hypergraph duality problem through logic
- scientific article; zbMATH DE number 7286679 (Why is no real title available?)
- Experimental comparison of the two Fredman-Khachiyan-algorithms
- Generating minimal redundant and maximal irredundant subhypergraphs
- New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- Computational aspects of monotone dualization: a brief survey
This page was built for publication: A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638034)
