跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.24386 · v1

Even Faster Algorithms for Bounded Integer Programming

首次提交 2026-11-18 21:16
版本更新 2026-11-18 21:16
雷达观测 2026-11-19 15:04
arXiv ↗PDF ↗

摘要

We study integer programs min⁡{cTx:Ax=b,l≤x≤u,x∈Zn}\min\{\mathbf{c}^{T}\mathbf{x}: A\mathbf{x}=\mathbf{b},\mathbf{l}\le\mathbf{x}\le\mathbf{u},\mathbf{x}\in\mathbb{Z}^n\} with a fixed number dd of equality constraints and constraint coefficients of absolute value at most NN. Chen, Mao, and Zhang recently solved such programs in almost N2dN^{2d} time. We show that any polynomial saving for (min⁡,+)(\min,+)-convolution carries over to this problem. If witnessed (min⁡,+)(\min,+)-convolution of arrays of length mm can be computed in O~(mρ)\tilde{O}(m^ρ) time with error probability pp, then for every ε>0\varepsilon>0 bounded integer programming can be solved in O~(n+N(max⁡{ρ,3/2}+ε)d)\tilde{O}\bigl(n+N^{(\max\{ρ,3/2\}+\varepsilon)d}\bigr) time with the same error probability pp, up to polynomial factors in the encoding length and the cost of one linear program. A deterministic convolution algorithm yields a deterministic integer programming algorithm. Combined with recent truly subquadratic algorithms for (min⁡,+)(\min,+)-convolution, this gives a deterministic algorithm running in O~(n+N1.99986 d)\tilde{O}(n+N^{1.99986\,d}) time and a randomized algorithm running in O~(n+N1.9602 d)\tilde{O}(n+N^{1.9602\,d}) time, up to the same factors.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 21:16 · 最新观测版本

Even Faster Algorithms for Bounded Integer Programming

We study integer programs min⁡{cTx:Ax=b,l≤x≤u,x∈Zn}\min\{\mathbf{c}^{T}\mathbf{x}: A\mathbf{x}=\mathbf{b},\mathbf{l}\le\mathbf{x}\le\mathbf{u},\mathbf{x}\in\mathbb{Z}^n\} with a fixed number dd of equality constraints and constraint coefficients of absolute value at most NN. Chen, Mao, and Zhang recently solved such programs in almost N2dN^{2d} time. We show that any polynomial saving for (min⁡,+)(\min,+)-convolution carries over to this problem. If witnessed (min⁡,+)(\min,+)-convolution of arrays of length mm can be computed in O~(mρ)\tilde{O}(m^ρ) time with error probability pp, then for every ε>0\varepsilon>0 bounded integer programming can be solved in O~(n+N(max⁡{ρ,3/2}+ε)d)\tilde{O}\bigl(n+N^{(\max\{ρ,3/2\}+\varepsilon)d}\bigr) time with the same error probability pp, up to polynomial factors in the encoding length and the cost of one linear program. A deterministic convolution algorithm yields a deterministic integer programming algorithm. Combined with recent truly subquadratic algorithms for (min⁡,+)(\min,+)-convolution, this gives a deterministic algorithm running in O~(n+N1.99986 d)\tilde{O}(n+N^{1.99986\,d}) time and a randomized algorithm running in O~(n+N1.9602 d)\tilde{O}(n+N^{1.9602\,d}) time, up to the same factors.

查看此版本解读 →查看此版本原文 ↗