Deterministic O(n^{2.686})-time algorithm for Monotone Min-Plus Product and n^{1.5+o(1)}-time algorithm for Monotone Min-Plus Convolution, derandomizing prior randomized results.
On the Fine-Grained Complexity of One-Dimensional Dynamic Programming , booktitle =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deterministic Monotone Min-Plus Product and Convolution
Deterministic O(n^{2.686})-time algorithm for Monotone Min-Plus Product and n^{1.5+o(1)}-time algorithm for Monotone Min-Plus Convolution, derandomizing prior randomized results.