长、短和随机
The Long, the Short and the Random
摘要：
我们提供了坚实的证据，理论和经验，对随机稀疏$\#Ω(\log n)$ -SAT实例，它计算的精确计数满足分配在次指数时间的确定性算法的存在。该算法使用了一个很好的组合性质，每个CNF公式，它涉及到它的单调子公式的空间的不满意的分配的数量。
英文摘要：
We furnish solid evidence, both theoretical and empirical, towards the existence of a deterministic algorithm for random sparse $\#Ω(\log n)$-SAT instances, which computes the exact counting of satisfying assignments in sub-exponential time. The algorithm uses a nice combinatorial property that every CNF formula has, which relates its number of unsatisfying assignments to the space of its monotone sub-formulae.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
