arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.02886cs.CCcs.DS
收藏

局部枚举:Not-All-Equal情形

Local Enumeration: The Not-All-Equal Case

Mohit Gurumukhani, Ramamohan Paturi, Michael Saks, Navid Talebanfard

AI总结:

本文提出更简单的NAE局部枚举问题NAE-Enum(k,t),并改进已有随机算法,使其以匹配下界的期望时间poly(n)·6^(n/4)最优求解NAE-Enum(3,n/2)。

摘要:

Gurumukhani等人(CCC’24)提出了局部枚举问题Enum(k, t),作为打破超强指数时间假说(SSETH)的一种方法:对于自然数k和参数t,给定一个不含Hamming权重小于t(n)的可满足赋值的n变量k-CNF,枚举Hamming权重恰好为t(n)的所有可满足赋值。此外,他们给出了一种用于Enum(k, t)的随机算法,并采用新的思想分析了第一个非平凡情形,即k=3。特别地,他们以期望1.598^n时间解决了Enum(3, n/2)。一个简单构造给出了6^(n/4)≈1.565^n的下界。本文证明,要打破SSETH,只需考虑更简单的局部枚举问题NAE-Enum(k, t):对于自然数k和参数t,给定一个不含Hamming权重小于t(n)的可满足赋值的n变量k-CNF,枚举Hamming权重恰好为t(n)的所有Not-All-Equal(NAE)解,即在每个子句中既满足某个文字又证伪某个文字的解。我们改进了Gurumukhani等人的算法,并证明它能最优地求解NAE-Enum(3, n/2),即期望运行时间为poly(n)·6^(n/4)。

英文摘要:

Gurumukhani et al. (CCC'24) proposed the local enumeration problem Enum(k, t) as an approach to break the Super Strong Exponential Time Hypothesis (SSETH): for a natural number $k$ and a parameter $t$, given an $n$-variate $k$-CNF with no satisfying assignment of Hamming weight less than $t(n)$, enumerate all satisfying assignments of Hamming weight exactly $t(n)$. Furthermore, they gave a randomized algorithm for Enum(k, t) and employed new ideas to analyze the first non-trivial case, namely $k = 3$. In particular, they solved Enum(3, n/2) in expected $1.598^n$ time. A simple construction shows a lower bound of $6^{\frac{n}{4}} \approx 1.565^n$. In this paper, we show that to break SSETH, it is sufficient to consider a simpler local enumeration problem NAE-Enum(k, t): for a natural number $k$ and a parameter $t$, given an $n$-variate $k$-CNF with no satisfying assignment of Hamming weight less than $t(n)$, enumerate all Not-All-Equal (NAE) solutions of Hamming weight exactly $t(n)$, i.e., those that satisfy and falsify some literal in every clause. We refine the algorithm of Gurumukhani et al. and show that it optimally solves NAE-Enum(3, n/2), namely, in expected time $poly(n) \cdot 6^{\frac{n}{4}}$.

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

↑