Sorting Can Exponentially Speed Up Pure Dynamic Programming

Stasys Jukna, Hannes Seiwert. Sorting Can Exponentially Speed Up Pure Dynamic Programming. Electronic Colloquium on Computational Complexity (ECCC), 26:158, 2019. [doi]

Abstract

Abstract is missing.