Author:
Flum Jörg,Grohe Martin,Weyer Mark
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference19 articles.
1. Fixed-parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogs;Abrahamson;Ann. Pure Appl. Logic,1995
2. Graph rewriting: an algebraic and logic approach;Courcelle,1990
3. R. Downey, Parameterized complexity for the skeptic, in: Proceedings of the 18th IEEE Conference on Computational Complexity, 2003.
4. R.G. Downey, P.A. Evans, M.R. Fellows, Parameterized learning complexity, in: Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993, pp. 51–57.
5. Fixed-parameter tractability and completeness III: some structural aspects of the W-hierarchy;Downey,1993
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献