Zongsheng Gao

Learn More
Consider a random k-conjunctive normal form F k (n, rn) with n variables and rn clauses. We prove that if the probability that the formula F k (n, rn) is satisfiable tends to 0 as n→∞, then r ⩾ 2.83, 8.09, 18.91, 40.81, and 84.87, for k = 3, 4, 5, 6, and 7, respectively. SAT 问题是第一个被证明的 NP 完全问题, 是理论计算机科学研究的核心问题之一。 自从上世纪九十年代初发现 NP 完全问题存在相变现象以来, 随机 k-SAT(More)
  • 1