Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues
- 1 June 1995
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 73 (3) , 235-276
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Parameterized Computational Feasibility1995
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993
- Fixed-parameter complexity and cryptography1993
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- Refining Nondeterminism in Relativized Polynomial-Time Bounded ComputationsSIAM Journal on Computing, 1980
- On the complexity of some two-person perfect-information gamesJournal of Computer and System Sciences, 1978
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- A Combinatorial Problem Which Is Complete in Polynomial SpaceJournal of the ACM, 1976