Pages that link to "Item:Q2719122"
From MaRDI portal
The following pages link to Dual-bounded generating problems: Partial and multiple transversals of a hypergraph (Q2719122):
Displaying 29 items.
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization (Q507518) (← links)
- Algorithms for \(k\)-meet-semidistributive lattices (Q507534) (← links)
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Blockers and transversals (Q1043948) (← links)
- Interior and exterior functions of positive Boolean functions. (Q1408452) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← 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)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- Efficient algorithms for dualizing large-scale hypergraphs (Q2449091) (← links)
- On enumerating minimal dicuts and strongly connected subgraphs (Q2471808) (← links)
- Invited talks (Q2692717) (← links)
- Transversal hypergraphs and families of polyhedral cones (Q2768039) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- A Lower Bound for the HBC Transversal Hypergraph Generation (Q5416742) (← links)
- Foundations of Information and Knowledge Systems (Q5901856) (← links)
- On Dualization over Distributive Lattices (Q6045449) (← links)
- Hypergraph Horn functions (Q6499011) (← 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)
