re: Dynamic Programming vs Divide-and-Conquer VIEW POST


Implications of Memoization techniques had always recalled to me a sort of «Heisenberg Uncertainty Principle» applied to the Computability Theory Field, could state something such: S(n)T(n) >= \h.

It seems to me that you've be influenced by the same echo and you recognized something similar in this article:

  • DP wastes the Space for the benefit of the Time
  • (but) DC doesn't need to waste the space

Honestly, I can't figurate any other correlation.

Anyway thanks for sharing your thoughts 👍

code of conduct - report abuse