Author:
Downey Rodney G.,Fellows Michael R.
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Fixed parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogs;Abrahamson;Ann. Pure Appl. Logic,1995
2. Parameterized complexity analysis in computational biology;Bodlaender;Comput. Appl. Biosci.,1995
3. The parameterized complexity of the longest common subsequence problem;Bodlaender;Theoret. Comput. Sci. A,1995
4. On the complexity of k-processor scheduling;Bodlaender;Oper. Res. Lett.,1995
5. Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy;Bodlaender,1994
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献