On problems equivalent to (min, +)-convolution

In the recent years, significant progress has been made in explaining apparent hardness of improving over naive solutions for many fundamental polynomially solvable problems. This came in the form of conditional lower bounds - reductions from a problem assumed to be hard. These include 3SUM, All-Pairs Shortest Paths, SAT and Orthogonal Vectors, and others. In the (min, +)-convolution problem, the goal is to compute a sequence (c[i]) _i=0^n-1, where c[κ] = min _{i=0, ., κ}{a[i] + b[κ - i]}, given sequences (a[i]) _i=0^n-1 and (b[i]) _i=0^n-1. This can easily be done in O(n²) time, but no O(n^2-ϵ) algorithm is known for ϵ > 0. In this paper we undertake a systematic study of the (min, +)-convolution problem as a hardness assumption. As the first step, we establish equivalence of this problem to a group of other problems, including variants of the classic knapsack problem and problems related to subadditive sequences. The (min, +)-convolution has been used as a building block in algorithms for many problems, notably problems in stringology. It has also already appeared as an ad hoc hardness assumption. We investigate some of these connections and provide new reductions and other results.