Pages that link to "Item:Q2568440"
From MaRDI portal
The following pages link to Tight lower bounds for certain parameterized NP-hard problems (Q2568440):
Displayed 6 items.
- Parameterized graph separation problems (Q820151) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard (Q924881) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)