期刊文献+

On the upper bounds of (1,0)-super solutions for the regular balanced random (k,2s)-SAT problem

原文传递
导出
摘要 This paper explores the conditions which make a regular balancedrandom(k,2s)-CNFformula(1,O)-unsatisfiable with high probability.The conditions also make a random instance of the regular balanced(k-1,2(k-1)s)-SAT problem unsatisfiable with high probability,where the instance obeys a distribution which differs from the distribution obeyed by a regular balanced random(k-1,2(k-1)s)-CNF formula.Let F be a regular balanced random(k,2s)-CNF formula where k≥3,then there exists a number so such that F is(1,O)-unsatisfiable with high probability if s>so.A numerical solution of the number so when k e(5,6,...,14)is given to conduct simulated experiments.The simulated experiments verify the theoretical result.Besides,the experiments also suggest that F is(1,O)-satisfiable with high probability if s is less than a certain value.
出处 《Frontiers of Computer Science》 SCIE EI CSCD 2024年第4期139-146,共8页 中国计算机科学前沿(英文版)
基金 Scientific Research Project for Introduced Talents of Guizhou University of Finance and Economics(No.2021YJ007) National Natural Science Foundation of China(Grant Nos.61862051,61762019,62241206) Top-notch Talent Program of Guizhou Province(No.KY[2018]080) Science and Technology Foundation of Guizhou Province(No.20191299) foundation of Qiannan Normal University for Nationalities(Nos.QNSYRC201715,QNSY2018JS013).
  • 相关文献

参考文献3

二级参考文献4

共引文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部