Perfect Code is \(W[1]\)-complete
type: Item
instance of: scholarly article
title: Perfect Code is \(W[1]\)-complete
zbMATH Open document ID: 1032.68085
DOI: 10.1016/S0020-0190(01)00207-1
author: Marco Cesati
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1767422
zbMATH Keywords: Computational complexity
zbMATH Keywords: Parameterized computational complexity
zbMATH Keywords: Perfect Code
zbMATH Keywords: Weighted Exact Conjunctive Normal Form Satisfiability
zbMATH Keywords: W[1]-completeness
MaRDI profile type: Publication
cites work: On the parameterized complexity of short computation and factorization
cites work: The Turing way to parameterized complexity
cites work: Computation Models for Parameterized Complexity
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Threshold dominating sets and an improved characterization of \(W[2]\)
cites work: Q4393480
cites work: Q4501141
description: scientific article; zbMATH DE number 1767422