Complexity Analysis of Mixed Constraint Satisfaction Problems

• 作者: Xiaomei Shi
• 来源期刊: 应用科学(英文)
• 学科: 数学
• 关键词: Model RBmix Tree-Like RESOLUTION COMPLEXITY HARD Instances
• 年，卷（期）: 2017,（4）
• 页码范围: 129-139
• 页数: 11页
• 分类号: O1

摘要

This paper analyzes the resolution complexity of a random CSP model named model RBmix, the instance of which is composed by constraints with different length. For model RBmix, the existence of phase transitions has been established and the threshold points have been located exactly. By encoding the random instances into CNF formulas, it is proved that almost all instances of model RBmix have no tree-like resolution proofs of less than exponential size. Thus the model RBmix can generate abundant hard instances in the threshold. This result is of great significance for algorithm testing and complexity analysis in NP-complete problems.