← 研踪 PaperTrailarXiv:2611.22809 · v1
A Note on Truly Subquadratic Time FPTAS for Knapsack
首次提交 2026-11-17 22:01
版本更新 2026-11-17 22:01
雷达观测 2026-11-18 19:41
摘要
We show that an -time algorithm for integer -convolution, where , gives a randomized fully polynomial-time approximation scheme for -- Knapsack running in time. The algorithm returns a feasible solution whose profit is at least the optimum divided by , with high probability. We use the all-capacities proximity decomposition of Chen, Lian, Mao, and Zhang. Its two quadratic computations are replaced by blocked computation of requested prefix and suffix functions, and exact computation within groups sharing one of Chan's profit grids. Thus the approximation scheme retains half of the saving in the convolution exponent. Wang's weighted-cache 3SUM bound, transferred to witnessed integer convolution by Zhou, gives the numerical bound .
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 22:01 · 最新观测版本
A Note on Truly Subquadratic Time FPTAS for Knapsack
We show that an -time algorithm for integer -convolution, where , gives a randomized fully polynomial-time approximation scheme for -- Knapsack running in time. The algorithm returns a feasible solution whose profit is at least the optimum divided by , with high probability. We use the all-capacities proximity decomposition of Chen, Lian, Mao, and Zhang. Its two quadratic computations are replaced by blocked computation of requested prefix and suffix functions, and exact computation within groups sharing one of Chan's profit grids. Thus the approximation scheme retains half of the saving in the convolution exponent. Wang's weighted-cache 3SUM bound, transferred to witnessed integer convolution by Zhou, gives the numerical bound .
查看此版本解读 →查看此版本原文 ↗