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 条
12345