Advice classes of parameterized tractability
Authors:
- Liming CaiLCLiming Cai
- Jianer ChenJCJianer Chen
- Rodney G. DowneyRDRodney G. Downey
- Michael R. FellowsMFMichael R. Fellows
- 6 March 1997
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 84 (1) , 119-138
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analoguesAnnals of Pure and Applied Logic, 1995
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993
- On the Complexity of Covering Vertices by Faces in a Planar GraphSIAM Journal on Computing, 1988
- Word Problems Solvable in LogspaceJournal of the ACM, 1977