Pages that link to "Item:Q2953406"
From MaRDI portal
The following pages link to The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406):
Displaying 8 items.
- Compressed representation of learning spaces (Q1679036) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- Minimal winning coalitions and orders of criticality (Q2095937) (← links)
- (Q5140714) (← links)
- Implementing Efficient All Solutions SAT Solvers (Q5266602) (← links)
- Compression with wildcards: all exact or all minimal hitting sets (Q6083242) (← links)
- Towards formal XAI: formally approximate minimal explanations of neural networks (Q6535352) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
