Super solutions of the model RB
作者机构:Department of MathematicsBeijing Technology and Business UniversityBeijing 100048China School of Mathematics and PhysicsUniversity of Science and Technology BeijingBeijing 100083China
出 版 物:《Frontiers of Computer Science》 (中国计算机科学前沿(英文版))
年 卷 期:2022年第16卷第6期
页 面:191-193页
核心收录:
学科分类:07[理学] 0835[工学-软件工程] 0701[理学-数学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:supported by the National Natural Science Foundation of China (Grant Nos.61702019 11801028).
主 题:theory. constraints trivial
摘 要:1 Introduction Constraint satisfaction problems(CSPs)have come to play a prominent role in the area of computer science,statistical physics and information theory.A CSP instance involves a set of variables and a set of constraints,and the task is to find a solution(an assignment of variables that satisfies all the constraints)or to prove the unsolvability.Model RB[1]is a CSP model proposed to overcome the trivial unsatisfiability of standard Model B[2].