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 条

[31] RECONSTRUCTION AND CLUSTERING IN RANDOM CONSTRAINT SATISFACTION PROBLEMS
Montanari, Andrea
Restrepo, Ricardo
Tetali, Prasad
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (02) : 771 - 808
[32] On the freezing of variables in random constraint satisfaction problems
Semerjian, Guilhem
JOURNAL OF STATISTICAL PHYSICS, 2008, 130 (02) : 251 - 293
[33] The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems
Bodirsky, Manuel
Semanisinova, Zaneta
Lutz, Carsten
PROCEEDINGS OF THE 39TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS 2024, 2024,
[34] Technical Perspective Constraint Satisfaction Problems and Computational Complexity
Jerrum, Mark
COMMUNICATIONS OF THE ACM, 2010, 53 (09) : 98 - 98
[35] Experimental complexity analysis of continuous constraint satisfaction problems
Shang, Y
Fromherz, MPJ
INFORMATION SCIENCES, 2003, 153 : 1 - 36
[36] The complexity of Boolean constraint satisfaction local search problems
Chapdelaine, P
Creignou, N
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2005, 43 (1-4) : 51 - 63
[37] The complexity of Boolean constraint satisfaction local search problems
Philippe Chapdelaine
Nadia Creignou
Annals of Mathematics and Artificial Intelligence, 2005, 43 : 51 - 63
[38] The complexity of constraint satisfaction problems for small relation algebras
Cristani, M
Hirsch, R
ARTIFICIAL INTELLIGENCE, 2004, 156 (02) : 177 - 196
[39] The Asymptotics of the Clustering Transition for Random Constraint Satisfaction Problems
Louise Budzynski
Guilhem Semerjian
Journal of Statistical Physics, 2020, 181 : 1490 - 1522
[40] The replica symmetric phase of random constraint satisfaction problems
Coja-Oghlan, Amin
Kapetanopoulos, Tobias
Mueller, Noela
COMBINATORICS PROBABILITY & COMPUTING, 2020, 29 (03): : 346 - 422

← 1 2 3 4 5 →