Sorting can exponentially speed up pure dynamic programming (Q783692): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:04, 30 January 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
