The following pages link to (Q4634389):
Displaying 7 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)
- Possibilistic keys (Q2329094) (← links)
- (Q3386631) (← links)
- (Q5874488) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- Controlling entity integrity with key sets (Q6098153) (← links)