The resolution complexity of random constraint satisfaction problems

被引：2
|
作者：
Molloy, M [1 ]
Salavatipour, M [1 ]
机构：
[1] Univ Toronto, Dept Comp Sci, Toronto, ON, Canada
来源：
44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 2003年
关键词：
D O I：
10.1109/SFCS.2003.1238207
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider random instances of constraint satisfaction problems where each variable has domain size d, and each constraint contains t restrictions on k variables. For each (d, k, t) we determine whether the resolution complexity is a.s. constant, polynomial or exponential in the number of variables. For a particular range of (d, k, t), we determine a sharp threshold for resolution complexity where the resolution complexity drops from a.s. exponential to a.s. polynomial when the clause density passes a specific value.
引用
收藏
页码：330 / 339
页数：10
相关论文
共 50 条
  • [21] Models for random constraint satisfaction problems
    Molloy, M
    SIAM JOURNAL ON COMPUTING, 2003, 32 (04) : 935 - 949
  • [22] On the Computational Complexity of Monotone Constraint Satisfaction Problems
    Hermann, Miki
    Richoux, Florian
    WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5431 : 286 - 297
  • [23] On the Complexity of Trial and Error for Constraint Satisfaction Problems
    Ivanyos, Gabor
    Kulkarni, Raghav
    Qiao, Youming
    Santha, Miklos
    Sundaram, Aarthi
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 663 - 675
  • [24] On the complexity of trial and error for constraint satisfaction problems
    Ivanyos, Gabor
    Kulkarni, Raghav
    Qiao, Youming
    Santha, Miklos
    Sundaram, Aarthi
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2018, 92 : 48 - 64
  • [25] On the Descriptive Complexity of Temporal Constraint Satisfaction Problems
    Bodirsky, Manuel
    Rydval, Jakub
    JOURNAL OF THE ACM, 2023, 70 (01)
  • [26] THE COMPLEXITY OF COMBINATIONS OF QUALITATIVE CONSTRAINT SATISFACTION PROBLEMS
    Bodirsky, Manuel
    Greiner, Johannes
    LOGICAL METHODS IN COMPUTER SCIENCE, 2020, 16 (01)
  • [27] Complexity of Combinations of Qualitative Constraint Satisfaction Problems
    Bodirsky, Manuel
    Greiner, Johannes
    AUTOMATED REASONING, IJCAR 2018, 2018, 10900 : 263 - 278
  • [28] On the Freezing of Variables in Random Constraint Satisfaction Problems
    Guilhem Semerjian
    Journal of Statistical Physics, 2008, 130 : 251 - 293
  • [29] Biased landscapes for random constraint satisfaction problems
    Budzynski, Louise
    Ricci-Tersenghi, Federico
    Semerjian, Guilhem
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2019,
  • [30] Generating random solutions for constraint satisfaction problems
    Dechter, R
    Kask, K
    Bin, E
    Emek, R
    EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, 2002, : 15 - 21
12345