Sorting can exponentially speed up pure dynamic programming (Q783692): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 2012.12838 / rank | |||
Normal rank | |||
Revision as of 16:46, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sorting can exponentially speed up pure dynamic programming |
scientific article |
Statements
Sorting can exponentially speed up pure dynamic programming (English)
0 references
4 August 2020
0 references
spanning tree
0 references
MST problem
0 references
dynamic programming
0 references
computational complexity
0 references
