eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2024-01-24
4:1
4:23
10.4230/LIPIcs.ITCS.2024.4
article
Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming
Alman, Josh
1
Turok, Ethan
1
Yu, Hantao
1
Zhang, Hengzhi
1
Columbia University, New York, NY, USA
Generalizing work of Künnemann, Paturi, and Schneider [ICALP 2017], we study a wide class of high-dimensional dynamic programming (DP) problems in which one must find the shortest path between two points in a high-dimensional grid given a tensor of transition costs between nodes in the grid. This captures many classical problems which are solved using DP such as the knapsack problem, the airplane refueling problem, and the minimal-weight polygon triangulation problem. We observe that for many of these problems, the tensor naturally has low tensor rank or low slice rank.
We then give new algorithms and a web of fine-grained reductions to tightly determine the complexity of these problems. For instance, we show that a polynomial speedup over the DP algorithm is possible when the tensor rank is a constant or the slice rank is 1, but that such a speedup is impossible if the tensor rank is slightly super-constant (assuming SETH) or the slice rank is at least 3 (assuming the APSP conjecture).
We find that this characterizes the known complexities for many of these problems, and in some cases leads to new faster algorithms.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol287-itcs2024/LIPIcs.ITCS.2024.4/LIPIcs.ITCS.2024.4.pdf
Fine-grained complexity
Dynamic programming
Least-weight subsequence