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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.