Greedy can beat pure dynamic programming (Q1628699)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy can beat pure dynamic programming |
scientific article |
Statements
Greedy can beat pure dynamic programming (English)
0 references
5 December 2018
0 references
computational complexity
0 references
spanning tree
0 references
arithmetic circuit
0 references
tropical circuit
0 references
