ECCC-Report TR18-042https://eccc.weizmann.ac.il/report/2018/042Comments and Revisions published for TR18-042en-usThu, 01 Mar 2018 19:25:26 +0200
Paper TR18-042
| Incremental versus Non-Incremental Dynamic Programming |
Stasys Jukna
https://eccc.weizmann.ac.il/report/2018/042Many dynamic programming algorithms for discrete optimization problems are "pure" in that they only use min/max and addition operations in their recursions. Some of them, in particular those for various shortest path problems, are even "incremental" in that one of the inputs to the addition operations is a variable. We present an explicit optimization problem such that it can be solved by a pure DP algorithm using a polynomial number of operations, but any incremental DP algorithm for this problem requires a super-polynomial number of operations.Thu, 01 Mar 2018 19:25:26 +0200https://eccc.weizmann.ac.il/report/2018/042