arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1809.04312cs.CC
收藏

k-可满足性中不完全相等的诅咒与祝福

The Curse and Blessing of Not-All-Equal in k-Satisfiability

S. Cliff Liu

摘要:

作为$k$ -SAT问题的自然变体,NAE-$k$-SAT还要求每个子句中的文字采用不全相等(NAE)真值。本文研究了求解NAE-$k$-SAT和MAX-NAE- $k$ -SAT近似的最坏情况的时间复杂度,作为$k$、变量数$n$和性能比$δ$的函数。后一个问题要求至少$δ$倍的最优解。我们的主要成果包括:(1)NAE- $k$ -SAT的确定性算法,它比所有$k \ge 3$上$k$ -SAT的最佳确定性算法更快。以前,没有已知的NAE-$k$-SAT算法比$k$-SAT算法更快.对于$k = 3$,我们实现了$1.326^n$的上界。$3$ -SAT的相应界限是$1.328^n$ . (2)MAX-NAE- $k$ -SAT近似的一种随机算法,具有上界$(2 - ε_k(δ))^n$,其中$ε_k(δ) > 0$仅取决于$k$和$δ$。以前,没有上限比平凡$2^n$是已知的MAX-NAE- $k$ -SAT近似$k \ge 4$。对于$δ= 0.9$和$k = 4$,我们得到了$1.947^n$的上界。(3)MAX-NAE- $k$ -SAT近似的确定性算法。对于$δ= 0.9$和$k = 3$,我们实现了$1.698^n$的上界,这优于MAX-NAE- $3$ -SAT精确算法的上界$1.731^n$。我们的发现为以下问题提供了新的线索:NAE-$k$-SAT比$k$-SAT容易吗?至少在精确地和确定性地解决问题上,答案可能是肯定的,而近似地解决MAX-NAE- $k$ -SAT可能比在$k \ge 4$上解决MAX-$k$-SAT更难。

英文摘要:

As a natural variant of the $k$-SAT problem, NAE-$k$-SAT additionally requires the literals in each clause to take not-all-equal (NAE) truth values. In this paper, we study the worst-case time complexities of solving NAE-$k$-SAT and MAX-NAE-$k$-SAT approximation, as functions of $k$, the number of variables $n$, and the performance ratio $δ$. The latter problem asks for a solution of at least $δ$ times the optimal. Our main results include: (1) A deterministic algorithm for NAE-$k$-SAT that is faster than the best deterministic algorithm for $k$-SAT on all $k \ge 3$. Previously, no NAE-$k$-SAT algorithm is known to be faster than $k$-SAT algorithms. For $k = 3$, we achieve an upper bound of $1.326^n$. The corresponding bound for $3$-SAT is $1.328^n$. (2) A randomized algorithm for MAX-NAE-$k$-SAT approximation, with upper bound $(2 - ε_k(δ))^n$ where $ε_k(δ) > 0$ only depends on $k$ and $δ$. Previously, no upper bound better than the trivial $2^n$ is known for MAX-NAE-$k$-SAT approximation on $k \ge 4$. For $δ= 0.9$ and $k = 4$, we achieve an upper bound of $1.947^n$. (3) A deterministic algorithm for MAX-NAE-$k$-SAT approximation. For $δ= 0.9$ and $k = 3$, we achieve an upper bound of $1.698^n$, which is better than the upper bound $1.731^n$ of the exact algorithm for MAX-NAE-$3$-SAT. Our finding sheds new light on the following question: Is NAE-$k$-SAT easier than $k$-SAT? The answer might be affirmative at least on solving the problems exactly and deterministically, while approximately solving MAX-NAE-$k$-SAT might be harder than MAX-$k$-SAT on $k \ge 4$.

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

↑