Pages that link to "Item:Q1028117"
From MaRDI portal
The following pages link to Lower bounds for three algorithms for transversal hypergraph generation (Q1028117):
Displaying 14 items.
- Transformation and decomposition of clutters into matroids (Q526353) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
- Simplicial complexes and closure systems induced by indistinguishability relations (Q2408539) (← links)
- Efficient algorithms for dualizing large-scale hypergraphs (Q2449091) (← links)
- The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678) (← links)
- Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds (Q5096958) (← links)
- Local dissymmetry on graphs and related algebraic structures (Q5242804) (← links)
- Decision systems in rough set theory: A set operatorial perspective (Q5376483) (← links)
- A Lower Bound for the HBC Transversal Hypergraph Generation (Q5416742) (← links)
- Computing and Combinatorics (Q5716999) (← links)
- Granular computing on basic digraphs (Q5866244) (← links)
