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

作　　者：Xiaoling MO Daoyun XU Kai YAN Zaijun ZHANG 

机构地区：[1]College of Computer Science and Technology,Guizhou University,Guiyang 550025,China [2]Agricultural Development Bank of China,Beijing 100045,China [3]Key Laboratory of Complex Systems and Intelligent Computing and School of Mathematics and Statistics,Qiannan Normal University for Nationalities,Duyun 558000,China

出　　处：《Frontiers of Computer Science》2022年第3期227-229,共3页中国计算机科学前沿（英文版）

基　　金：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 Cai[2019]QNSYXM-05).

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

关 键 词：problem. PROBLEM combinatorial 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]