Greedy can beat pure dynamic programming (Q1628699)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6989096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy can beat pure dynamic programming |
scientific article; zbMATH DE number 6989096 |
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
0.8459829688072205
0 references
0.8210044503211975
0 references
0.8089848756790161
0 references
0.7432366609573364
0 references
0.7396395206451416
0 references
