Parameterized complexity of constraint satisfaction problems

被引：26
|
作者：
Marx, D [1 ]
机构：
[1] Budapest Univ Technol & Econ, Dept Comp Sci & Informat Theory, H-1521 Budapest, Hungary
来源：
COMPUTATIONAL COMPLEXITY | 2005年 / 14卷 / 02期
关键词：
constraint satisfaction; weighted satisfiability; parameterized complexity; weak separability;
D O I：
10.1007/s00037-005-0195-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove a parameterized analog of Schaefer's Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints from F has a satisfying assignment of weight exactly k is either fixed-parameter tractable (FPT) or W[1]-complete. We give a simple characterization of those constraints that make the problem fixed-parameter tractable. The special cases when the formula is restricted to be bounded occurrence, bounded treewidth, or planar are also considered: it turns out that in these cases the problem is in FPT for every constraint family F.
引用
收藏
页码：153 / 183
页数：31
相关论文
共 50 条
  • [1] Parameterized complexity of constraint satisfaction problems
    Marx, D
    [J]. 19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 139 - 149
  • [2] Parameterized complexity of constraint satisfaction problems
    Dániel Marx
    [J]. computational complexity, 2005, 14 : 153 - 183
  • [3] The Complexity of Constraint Satisfaction Problems
    Bodirsky, Manuel
    [J]. 32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 2 - 9
  • [4] Complexity of Conservative Constraint Satisfaction Problems
    Bulatov, Andrei A.
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2011, 12 (04)
  • [5] The Complexity of Temporal Constraint Satisfaction Problems
    Bodirsky, Manuel
    Kara, Jan
    [J]. JOURNAL OF THE ACM, 2010, 57 (02)
  • [6] Constraint Satisfaction Problems: Complexity and Algorithms
    Bulatov, Andrei A.
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2018), 2018, 10792 : 1 - 25
  • [7] The Complexity of Temporal Constraint Satisfaction Problems
    Bodirsky, Manuel
    Kara, Jan
    [J]. STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 29 - 38
  • [8] The Complexity of Phylogeny Constraint Satisfaction Problems
    Bodirsky, Manuel
    Jonsson, Peter
    Trung Van Pham
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2017, 18 (03)
  • [9] The complexity of recursive constraint satisfaction problems
    Marek, Victor W.
    Remmel, Jeffrey B.
    [J]. ANNALS OF PURE AND APPLIED LOGIC, 2009, 161 (03) : 447 - 457
  • [10] On the complexity of trial and error for constraint satisfaction problems
    Ivanyos, Gabor
    Kulkarni, Raghav
    Qiao, Youming
    Santha, Miklos
    Sundaram, Aarthi
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2018, 92 : 48 - 64
12345