Histo− and Dynamorphisms Revisited
Dynamic programming algorithms embody a widely used programming technique that optimizes recursively defined equations that have repeating subproblems. The standard solution uses arrays to share common results between successive steps, and while effective, this fails to exploit the structural proper...
Main Authors: | , |
---|---|
Format: | Conference item |
Published: |
ACM
2013
|