Pages that link to "Item:Q445242"
From MaRDI portal
The following pages link to Complexity and approximability of the cover polynomial (Q445242):
Displaying 8 items.
- Complexity and approximation of the connected set-cover problem (Q453623) (← links)
- Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
- An algorithm of polynomial order for computing the covering dimension of a finite space (Q1644532) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- Noncommutativity makes determinants hard (Q2347802) (← links)
- Partially Polynomial Kernels for Set Cover and Test Cover (Q2963898) (← links)
- Cover-Decomposition and Polychromatic Numbers (Q3092281) (← links)
- (Q4537179) (← links)
