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]

Authors

Stasys Jukna

This author has not been identified. Look up 'Stasys Jukna' in Google

Hannes Seiwert

This author has not been identified. Look up 'Hannes Seiwert' in Google