跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 19:58库内论文最新更新时间:2026-11-20 02:59

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

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

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

找到 4 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
版本更新 · 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

版本更新 · v2arXiv:2610.12392

用(单个)多立方体的平移铺砌三维空间是不可判定的

Tiling 3D Space by (Translates of) a Single Polycube is Undecidable

Erik D. Demaine, Stefan Langerman

AI 速读 基于摘要

作者证明:判定单个连通多立方体能否通过平移(以及可选旋转/反射)铺满三维欧氏空间是 co-RE 完全的,因而不可判定。

cs.CG · math.CO · math.MG

查看原文摘要

We prove co-RE-completeness, and thus undecidability, of the following problem: given a single (connected) polycube, decide whether it tiles 3D Euclidean space by translations. The same result holds if we also allow rotations and/or reflections. We reduce from Wang tiling using the decorated two-prime Sudoku construction of Greenfeld and Tao and a cyclic encoding adapted from OpenAI's 3D aperiodic tile, and apply a reduction of Kim to make the prototile connected (via faces). Dimension three is optimal: translational monotiling is known to be decidable in $\mathbb{Z}^2$ and for a single (possibly disconnected) polyomino in $\mathbb{R}^2$.

新论文 · v1arXiv:2611.11018

Solving Large Rubik's Cubes within a Factor of $2.37+o(1)$ of Optimal

Jeremy Mrzyglocki, Tomas Rokicki, Maxine Perroni-Scharf, Erik D. Demaine

原文摘要

We design optimized algorithms to solve the $n \times n \times n$ Rubik's Cube within $30.5 n^2 / \lg n + o(n^2 / \lg n)$ moves. This upper bound is asymptotically within a factor of $2.37$ of the known lower bound, which applies to almost all instances. The constant $30.5$ is also the first explicit constant factor for the known upper bound of $O(n^2 / \lg n)$, where the implicit constant of the previous algorithm was $1.01 \cdot 10^{40}$ (ten duodecillion). Thus we improve the upper-bound constant by a factor of more than $3.30 \cdot 10^{38}$ (330 undecillion). Our algorithm runs in time linear in the input size $N = Θ(n^2)$, and uses $O(\sqrt{N} \lg N)$ extra space (beyond the state of the cube). Our implementation is the first practical cube solver to generate solutions of length $O(n^2/\lg n)$. Our latest solver outperforms existing solvers for $n$ as small as $840$.

cs.DS · cs.CC

新论文 · v1arXiv:2611.04246

Polyominoes Folding into Four and Five Distinct Boxes

Erik D. Demaine, Toshihiro Shirakawa, Conner Silverstein, Reed Silverstein, Michael Tardibuono, Ryuhei Uehara

原文摘要

We present new results on polyomino nets that fold into four or five distinct boxes. With the help of AI, we first found examples with areas 532 and 2128, respectively. We analyze these examples and reduce their areas to 178 and 358, respectively. We also generalize the construction of the five-box net and show that infinitely many polyomino nets fold into five distinct boxes.

cs.CG