Fixed-parameter tractability and completeness II: On completeness for W[1]
- 1 April 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 141 (1-2), 109-131
- https://doi.org/10.1016/0304-3975(94)00097-3
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Fixed-parameter intractabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On limited nondeterminism and the complexity of the V-C dimensionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- 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
- Parameterized Computational FeasibilityPublished by Springer Nature ,1995
- ON DISJOINT CYCLESInternational Journal of Foundations of Computer Science, 1994
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993
- Fixed-parameter intractability II (extended abstract)Lecture Notes in Computer Science, 1993
- On search decision and the efficiency of polynomial-time algorithmsPublished by Association for Computing Machinery (ACM) ,1989
- Michael R. ΠGarey and David S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco1979, x + 338 pp.The Journal of Symbolic Logic, 1983