Satisfiability threshold of the random regular(s,c,k)-SAT problem

作     者：Xiaoling MO Daoyun XU Kai YAN Zaijun ZHANG Xiaoling MO;Daoyun XU;Kai YAN;Zaijun ZHANG

作者机构：College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China Agricultural Development Bank of ChinaBeijing 100045China Key Laboratory of Complex Systems and Intelligent Computing and School of Mathematics and StatisticsQiannan Normal University for NationalitiesDuyun 558000China 

出 版 物：《Frontiers of Computer Science》 (中国计算机科学前沿（英文版）)

年 卷 期：2022年第16卷第3期

页      面：227-229页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：the National Natural Science Foundation of China(Grant Nos.61762019,61862051 and 62062001) The Science and Technology Foundation of Guizhou Province(Qian Ke Ping Tai Ren CaiQNSYXM-05) 

主　　题：problem. problem combinatorial 

摘      要：1Introduction The satisfiability(SAT)problem is always a core problem in the field of computer *** theoretical and applied research have long been the common attention of many scholars in the field of artificial intelligence and mathematical *** the real world,all issues related to combinatorial optimization and coordination verification are closely related to SAT problem.