SAT的多对数成员可比性的推论
Consequences of Polylogarithmic Membership Comparability for SAT
浏览论文内容
中文总结 AI 辅助
该研究探讨多对数成员可比性对SAT的影响，通过成员比较器推导PH坍缩、时间复杂度界等结论，构造相对化谕示明确极限，并拓展弱优势等相关机制的推论。
中文摘要 AI 辅助
我们研究了成员比较器的推论，这类比较器可确定性地排除一个可能的成员向量，或相较于均匀猜测具有相对优势。对于任意有多项式界的元数，误差至多为$(1-1/poly(n))2^{-t}$的随机多项式时间比较器，可借助公共建议实现$NP/poly\cap coNP/poly$识别。证明过程用到了有限独立性、多项式出现证书，以及自包含的正关系建议转移。对于元数为$O((\log n)^d)$的SAT问题，无论是该相对间隙假设还是确定性可比性，都能推导出$PH=S^{NP}$、一致界$PH\subseteq BPTIME(2^{O((\log n)^{d^2})})$，以及具备多项式长度证书和无谕示确定性$2^{O((\log n)^d)}$谓词的对称验证。带多项式建议的确定性解码具有相同的指数$d$。将随机模拟应用于一个无条件对角语言，可得到对于任意固定的$\varepsilon>0$，在无建议情况下$\mathrm{BPP}\subsetneq BPTIME(2^{O((\log n)^{d^2+\varepsilon})})$。在任意固定次数的自复合下，更大的时钟仍保持次指数级。一个分层谕示满足确定性可比性且$NP^O=coNP^O$，但排除了具有更小对数幂的随机NP算法，从而确立了SAT指数$d$的相对化极限。本扩展版本还完整研究了弱优势机制：节省$2^{-O((\log n)^d)}$可得到随机SAT指数$d$和固定层级$k$下的PH指数$d^k$；还研究了拟多项式与指数层级的推论、二元比较器的建议界，以及随机机制之间的证书长度边界。在确定性可比性下，一致确定性承诺唯一搜索还能得到$UEXP=EXP$。对于$d>1$时的常规第二层级坍缩$PH=Σ_2^p$仍未得到证明。
英文摘要
We study the consequences of membership comparators that exclude one possible membership vector, deterministically or with a relative advantage over uniform guessing. For every polynomially bounded arity, a randomized polynomial-time comparator of error at most $(1-1/poly(n))2^{-t}$ gives $ NP/ poly\cap coNP/ poly$ recognition with common advice. The proof uses limited independence, polynomial occurrence certificates, and a self-contained positive-relation advice transfer. For SAT at arity $O((\log n)^d)$, both this relative-gap hypothesis and deterministic comparability imply $PH=S^{NP}$, the uniform bound $PH\subseteq BPTIME(2^{O((\log n)^{d^2})})$, and symmetric verification with polynomial-length certificates and an oracle-free deterministic $2^{O((\log n)^d)}$ predicate. Polynomial-advice deterministic decoding has the same exponent $d$. Applying the randomized simulation to an unconditional diagonal language yields, for every fixed $\varepsilon>0$, $\mathrm{BPP}\subsetneq BPTIME(2^{O((\log n)^{d^2+\varepsilon})})$, without advice. The larger clock remains subexponential under every fixed number of self-compositions. A layered oracle satisfies deterministic comparability and $NP^O=coNP^O$ but excludes randomized NP algorithms with smaller logarithmic power, establishing a relativized limit on the SAT exponent $d$. This expanded version also develops the full weak-advantage regime, where saving $2^{-O((log n)^d)}$ gives randomized SAT exponent $d$ and PH exponent $d^k$ at fixed level $k$; the quasipolynomial and exponential hierarchy consequences; binary-comparator advice bounds; and the certificate-length boundary between the randomized regimes. Under deterministic comparability, uniform deterministic promise-unique search additionally gives $UEXP=EXP$. The ordinary second-level collapse $PH=Σ_2^p$ for $d>1$ remains unproved.
