Comparison of two approaches to dynamic programming

P.M. van den Broek, J.A.R. Noppen

    Research output: Contribution to journalArticleAcademic

    22 Downloads (Pure)


    Both in mathematics and in computer science Dynamic Programming is a well known concept. It is an algorithmic technique, which can be used to write efficient algorithms, based on the avoidance of multiple executions of identical subcomputations. Its definition in both disciplines is however quite different. The aim of this paper is to compare both definitions. It is shown that the computer science approach is more efficient, since it avoids the execution of unneeded subcomputations, whereas the mathematical approach has greater possibilities of reducing memory requirements.
    Original languageUndefined
    Article number10.1145/1054916.1054917
    Pages (from-to)111-116
    Number of pages6
    JournalSIGACT news
    Issue number4
    Publication statusPublished - Dec 2004


    • IR-61743
    • EWI-10194
    • METIS-234010

    Cite this