Stasys Jukna, Hannes Seiwert. Sorting Can Exponentially Speed Up Pure Dynamic Programming. Electronic Colloquium on Computational Complexity (ECCC), 26:158, 2019. [doi]
@article{JuknaS19-0,
title = {Sorting Can Exponentially Speed Up Pure Dynamic Programming},
author = {Stasys Jukna and Hannes Seiwert},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/158},
researchr = {https://researchr.org/publication/JuknaS19-0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {26},
pages = {158},
}