跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1084新增论文
+883其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 03:42 — 2026-11-19 03:42(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v2arXiv:2611.02650

ETH is Dead, Long Live SH

MIT Hardness Group, Josh Brunner, Erik D. Demaine, Fabian Frei, Timothy Gomez, Markus Hecher, Jeffery Li, Jayson Lynch

原文摘要

Among the recent flood of AI-based mathematical breakthroughs (the "mathpocalypse"), perhaps the biggest bombshells in theoretical computer science were two disproofs of the Exponential Time Hypothesis (ETH), via slightly subexponential algorithms for the classic $k$-Satisfiability problems. After the initial shock, the community quickly began to wonder at the implications: how do the hundreds if not thousands of ETH-based lower bounds in the literature need to change? It turns out, not much -- if we are willing to change the exponents ever so slightly. While Impagliazzo and Paturi's 1999 Exponential Time Hypothesis (ETH) is false, Stearns and Hunt's 1990 Satisfiability Hypothesis (SH) remains plausible. We prove that SH is equivalent to the recently proposed Weak ETH which rules out $O(2^{n^{1-\varepsilon}})$-time 3SAT algorithms for every constant $\varepsilon>0$, where $n$ is the number of variables. We show that SH (or Weak ETH) preserves the typical process for lower bounds: a polynomial-time reduction from a 3SAT formula of size $s$ (the number of variables plus clauses) to an instance of size $N\le s^{b+o(1)}$, for fixed blowup exponent $b>0$, rules out $O(2^{N^{1/b-\varepsilon}})$-time algorithms for every constant $\varepsilon>0$. By comparison, for an $N=O(s^b)$ blowup, ETH would have ruled out $2^{o(N^{1/b})}$-time algorithms. The framework also yields parameterized lower bounds ruling out a running time of $O(2^{k^{1/b-\varepsilon}})L^{O(1)}$ when the reduction produces an instance of length $L$ with parameter $k\le s^{b+o(1)}$. We also prove equivalence of the analogous counting hypotheses, #SH and Weak ETH, and that they rule out $O(2^{s^{1-\varepsilon}})$-time algorithms for #2SAT formulas of size $s$ for every constant $\varepsilon>0$.

cs.CC