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
- https://doi.org/10.1016/0168-0072(94)00034-z
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On fixed-parameter tractability and approximability of NP-hard optimization problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parameterized ComplexityPublished by Springer Nature ,1999
- 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 FeasibilityPublished by Springer Nature ,1995
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993
- Fixed-parameter complexity and cryptographyLecture Notes in Computer Science, 1993
- Refining Nondeterminism in Relativized Polynomial-Time Bounded ComputationsSIAM Journal on Computing, 1980
- 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