diff --git a/dynamic_programming/README.md b/dynamic_programming/README.md
index fe874d0..debe8c9 100644
--- a/dynamic_programming/README.md
+++ b/dynamic_programming/README.md
@@ -2,11 +2,10 @@
 
 <br>
 
-* dynamic programming is the process of taking a recursive algorithm and cache overlapping problems (repeated calls).
-* the runtime is given by the number of calls.
-* **top-down**: how can we divide the problem into sub-problems?
-    * top-down dynamic programming is called **memoization**.
-* **bottom-up**: solve for a simple case, then figure out for more elements.
+* dynamic programming is the process of taking a recursive algorithm and cache overlapping problems (repeated calls). the runtime is given by the number of calls.
+* **top-down** (**memoization**): how can we divide the problem into sub-problems?
+* **bottom-up** (**tabulation**): solve for a simple case, then figure out for more elements.
+
 
 <br>