Bounded tropical decomposition width forces modular subpolynomials to be convex, which yields faster min-plus convolution algorithms for multiple sequences and new Multiple-Choice Knapsack bounds.
0-1 Knapsack in Nearly Quadratic Time
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Structure of $(\min,+)$ Convolution
Bounded tropical decomposition width forces modular subpolynomials to be convex, which yields faster min-plus convolution algorithms for multiple sequences and new Multiple-Choice Knapsack bounds.