Pages that link to "Item:Q1877698"
From MaRDI portal
The following pages link to The \(k\)-feature set problem is \(W[2]\)-complete (Q1877698):
Displaying 6 items.
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- Stochastic local search for the FEATURE SET problem, with applications to microarray data (Q865564) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
