Perfect Code is W[1]-complete

Information Processing Letters

Volumn 81, Issue 3, 2002, Pages 163-168

  Cesati, Marco ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Computational complexity; Parameterized computational complexity; Perfect Code; W 1 completeness; Weighted Exact Conjunctive Normal Form Satisfiability

Indexed keywords

CODES (SYMBOLS); POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

PARAMETERIZED PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0037074665     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00207-1     Document Type: Article

References (9)

1. On the parameterized complexity of short computation and factorization
2. The turing way to the parameterized intractability
3. Computation models for parameterized complexity
4. Fixed-parameter tractability and completeness. I. Basic results
5. Fixed-parameter tractability and completeness. II. On completeness for W[1]
6. Threshold dominating set and an improved characterization of W[2]
7. Parameterized complexity, 1st edn.
8. Parameterized complexity of some problems in logic and linguistics (extended abstract)