Jump to content

Talk:Overlapping subproblems

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 71.146.88.109 (talk) at 05:56, 23 August 2011 (Merge into Dynamic Programming?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputing Stub‑class
WikiProject iconThis article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.
Note icon
This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the |auto= parameter.

Some comments on how to solve overlapping subproblems would be great. --Abdull 13:40, 24 February 2006 (UTC)[reply]

Merge into Dynamic Programming?

A term typically used to describe the feature of problems to which dynamic programming methodology can be applied. It is not likely that this entry could be developed into a decent article. —Preceding unsigned comment added by 114.94.168.176 (talk) 16:57, 9 March 2011 (UTC)[reply]


Move

Overlapping subproblemOverlapping subproblems – Here singular is just as meaningless as in "trowser" (Can you clap with one hand?) 71.146.88.109 (talk) 05:56, 23 August 2011 (UTC)[reply]