The following pages link to Computing and Combinatorics (Q5717021):
Displaying 6 items.
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Linear FPT reductions and computational lower bounds (Q3580971) (← links)
- (Q5005177) (← links)
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)