arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.09987cs.CC
收藏

在多项式时间内求解合取范式可满足性问题的线性互补定理

A Linear Complementarity Theorem to solve any Satisfiability Problem in conjunctive normal form in polynomial time

Giacomo Patrizi

摘要:

合取范式中的任何可满足性问题都可以在多项式时间内解决,方法是将其简化为3-sat公式并将其转换为线性互补问题(LCP),然后将其作为线性规划(LP)求解。在这个问题类中的任何实例,减少到LCP可以解决,提供一定的必要和充分条件。证明这些条件将满足所有问题在这一类是本文的贡献,这种推导需要一个非线性工具主义的方法,而不是一个现实的,并确认了优势的变分不等式实现。

英文摘要:

Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any instance in this problem class, reduced to a LCP may be solved, provided certain necessary and sufficient conditions hold. The proof that these conditions will be satisfied for all problems in this class is the contribution of this paper and this derivation requires a nonlinear Instrumentalist methodology rather than a Realistic one and confirms the advantages of a Variational Inequalities implementation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑