X3SAT的新最差情况上限
New Worst-Case Upper Bound for X3SAT
摘要：
文献中提出了精确3-可满足性（X3 SAT）算法的严格理论分析。如我们所知，以前的算法求解X3 SAT已经分析了仅关于变量的数量作为参数。然而，求解X3 SAT实例的时间复杂度不仅取决于变量的数量，还取决于子句的数量。因此，从另一个角度，即子句的数量，来利用时间复杂度是有意义的。在本文中，我们提出的算法，解决X3 SAT严格的复杂性分析，使用条款的数量作为参数。通过对算法的分析，我们得到了新的最坏情况上界O（1.15855m），其中m是子句数。
英文摘要：
The rigorous theoretical analyses of algorithms for exact 3-satisfiability (X3SAT) have been proposed in the literature. As we know, previous algorithms for solving X3SAT have been analyzed only regarding the number of variables as the parameter. However, the time complexity for solving X3SAT instances depends not only on the number of variables, but also on the number of clauses. Therefore, it is significant to exploit the time complexity from the other point of view, i.e. the number of clauses. In this paper, we present algorithms for solving X3SAT with rigorous complexity analyses using the number of clauses as the parameter. By analyzing the algorithms, we obtain the new worst-case upper bounds O(1.15855m), where m is the number of clauses.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
