Pages that link to "Item:Q5232759"
From MaRDI portal
The following pages link to Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling (Q5232759):
Displayed 10 items.
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
- (Q5874488) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)