Author:
Downey Rodney G.,Fellows Michael R.,Kapron Bruce M.,Hallett Michael T.,Wareham H. Todd
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. K. Abrahamson, R. Downey and M. Fellows, “Fixed-Parameter Intractability II,” Proc. 10th Symposium on Theoretical Aspects of Computer Science (STACS) (1993), 374–385, Springer-Verlag, Berlin, Lecture Notes in Computer Science.
2. G. Barton, R. Berwick, and E. Ristad, Computational Complexity and Natural Language, MIT Press, Cambridge, MA, 1987.
3. R. Berwick, The Acquisition of Syntactic Knowledge, MIT Press, Cambridge, MA, 1985.
4. H. Bodlaender, R. Downey, M. Fellows and H. T. Wareham, “The Parameterized Complexity of Sequence Alignment and Consensus,” Proceedings of the Fifth Symposium on Combinatorial Pattern Matching (CPM) 1994, to appear.
5. H. Bodlaender, M. Fellows and M. Hallett, “Beyond NP-Completeness for Problems of Bounded Width: Hardness for the W Hierarchy,” Proceedings of the ACM Symposium on the Theory of Computing (STOC) 1994, to appear.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献