Comment on Computers without clocks (2002) [pdf]parentComments−no_identd7yevery sub-problem is either NP-hard or NP-complete.Did you check if they're FPT? (Fixed Parameter Tractable)
Comments
Did you check if they're FPT? (Fixed Parameter Tractable)