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

D ≤ N^0.172 下的稀疏矩阵乘积及 3SUM、精确三角形问题、APSP 的无损归约,含阿贝尔群上的 3SUM 与坐标问题的二分性

Thin matrix products up to D <= N^0.172 and lossless reductions for 3SUM, Exact Triangle and APSP, with 3SUM over abelian groups and a dichotomy for coordinatewise problems

Ruhollah Majdoddin

AI总结:

该研究将矩阵定理的 D 上限提升至 N^0.172,改进 3SUM、精确三角形问题等的确定性算法指数,还给出坐标问题的二分性结论,得到 3SUM 等问题的更优时间复杂度。

摘要:

Alman 和 Vassilevska Williams(arXiv:2610.06783)首次给出了 3SUM 和 APSP 教科书算法的多项式级改进:确定性算法的指数分别为 3SUM 取 1.9992、精确三角形问题取 2.9983、APSP 取 2.99942。他们的算法包含两个步骤:一是矩阵定理,当 D ≤ N^ε(对任意 ε < 0.1204)时,以时间 N^2/D^γ(γ > 0)计算 N×D 整数矩阵与 D×N 整数矩阵乘积的 N^2/√D 个指定元素;二是将这三个问题归约为不平衡稀疏三角形问题。我们在两方面均作出改进:借助 Schönhage 的五项部分乘积张量,矩阵定理对任意 ε < 0.172 成立;预印本的归约对 3SUM 保留了矩阵定理四分之一的节省量,对精确三角形问题和 APSP 保留了一半,而我们的归约通过自适应调用三角形问题的计数版本、逐素数构建复合模,保留了全部节省量。综合上述改进,我们得到确定性 3SUM 的时间复杂度为 n^{1.9945+o(1)},精确三角形问题、(min,+)乘积及 APSP 的时间复杂度为 n^{2.9945+o(1)}。我们还改进了预印本中 3XOR 的证明概要,将其确定性求解时间复杂度降至 O(n^{1.99451})。此外,我们研究了该方法可实现真正次二次时间的其他三列表问题:对每个固定素数 p,可在 F_p^d 上以与 3XOR 相同的指数求解 3SUM;对每个指数为 p^2 的有限阿贝尔群(如 Z_4^d),可在 O(n^{1.99726}) 时间内求解 3SUM。对每个坐标三元组上具有固定关系 P 的坐标问题,经已验证的穷尽计算表明:每个布尔 P 和每个三字母上的函数 P,要么是 Z、F_2 或 F_3 上方程的解集,此时问题为真正次二次时间;要么具有正交向量的小工具,此时在正交向量假设下问题是困难的。在四字母上,经对称性分析,仅有四个函数关系不满足上述任一条件。

英文摘要:

Alman and Vassilevska Williams (arXiv:2610.06783) gave the first polynomial improvements over the textbook algorithms for 3SUM and APSP: deterministic algorithms with exponents 1.9992 for 3SUM, 2.9983 for Exact Triangle and 2.99942 for APSP. Their algorithm has two steps: a matrix theorem, computing N^2/sqrt(D) prescribed entries of the product of an N x D and a D x N integer matrix in time N^2/D^gamma, gamma > 0, when D <= N^eps, for every eps < 0.1204; and reductions from the three problems to the lopsided sparse triangle problem. We improve both. With Schönhage's five-term partial-product tensor, the matrix theorem holds for every eps < 0.172. The preprint's reductions keep a quarter of the matrix theorem's saving for 3SUM and a half for Exact Triangle and APSP; ours keep all of it, by calling the counting version of the triangle problem adaptively and building composite moduli one prime at a time. Together this gives deterministic 3SUM in n^{1.9945+o(1)}, and Exact Triangle, (min,+)-product and APSP in n^{2.9945+o(1)}. We also improve on the preprint's proof sketch for 3XOR and solve it deterministically in O(n^{1.99451}). Which other problems on three lists does the method make truly subquadratic? It solves 3SUM over F_p^d for every fixed prime p with 3XOR's exponents, and over every finite abelian group of exponent p^2, such as Z_4^d, in O(n^{1.99726}). For coordinatewise problems with a fixed relation P on every coordinate triple, a certified exhaustive computation shows that every Boolean P, and every functional P over three letters, either is the solution set of an equation over Z, F_2 or F_3, and the problem is then truly subquadratic, or has a gadget for Orthogonal Vectors, and the problem is then hard under the Orthogonal Vectors hypothesis. Over four letters, just four functional relations, up to symmetry, satisfy neither condition.

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

↑