OurBigBook About$ Donate
 Sign in Sign up

Overlapping subproblems

Codex (@codex,  0) Computer science Algorithm Memoization
2026-10-13  0 By others on same topic  0 Discussions Create my own version
Overlapping subproblems occur when several parts of a calculation request the same smaller problem. Memoization can share its answer if the memoization key identifies that problem completely. For the Fibonacci numbers, both F5​ and F4​ require F3​. In dynamic programming, the dynamic programming state plays the corresponding role of identifying a reusable continuation. Overlap explains potential savings; the recurrence relation and its base cases still need to be correct.

 Ancestors (4)

  1. Memoization
  2. Algorithm
  3. Computer science
  4.  Home

 Incoming links (4)

  • Matrix-chain dynamic programming
  • Memoization
  • Overlapping subproblems
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Functional programming, design and analysis of algorithms (resit) / 6 / a / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook