论文信息 - Perfect Code is W[1]-complete

Perfect Code is W[1]-complete

We show that the parameterized problem PERFECT CODE belongs to W[1]. This result closes an old open question, because it was often conjectured that PERFECT CODE could be a natural problem having complexity degree intermediate between W[1] and W[2]. This result also shows W[1]-membership of the parameterized problem WEIGHTED EXACT CNF SATISFIABILITY.

Marco Cesati

[1] Michael R. Fellows,et al. Threshold Dominating Sets and an Improved Characterization of W[2] , 1998, Theor. Comput. Sci..

[2] Liming Cai,et al. On the parameterized complexity of short computation and factorization , 1997, Arch. Math. Log..

[3] Michael R. Fellows,et al. Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[4] Miriam Di Ianni,et al. Computation Models for Parameterized Complexity , 1997, Math. Log. Q..

[5] Michael R. Fellows,et al. Parameterized Complexity , 1998 .

[6] Michael R. Fellows,et al. FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .