Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference9 articles.
1. H.L. Bodlaender, D. Kratsch, A note on fixed parameter intractability of some domination-related problems, Private communication, April 1994
2. On the parameterized complexity of short computation and factorization;Cai;Arch. Math. Logic,1997
3. The Turing way to the parameterized intractability;Cesati,2000
4. Computation models for parameterized complexity;Cesati;Math. Logic Quarterly,1997
5. Fixed-parameter tractability and completeness. I. Basic results;Downey;SIAM J. Comput.,1995
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献